Theoretical Computer Science

Publications 2006

Contributions to Books / Journals

Journal Article (Original Paper)
  • Baaz, Matthias; Moser, Georg (2006): Herbrand's theorem and term induction.
    In: Archive for Mathematical Logic 45/4, pp. 447 - 503. (DOI) (Web link)

  • Moser, Georg (2006): Ackermann's substitution method (remixed).
    In: Annals of Pure and Applied Logic 142/1-3, pp. 1 - 18. (DOI) (Web link)

  • Moser, Georg; Zach, Richard (2006): The Epsilon Calculus and Herbrand Complexity.
    In: Studia Logica 82/1, pp. 133 - 155. (DOI) (Web link)

Proceedings Article (Full Paper)
  • Moser, Georg (2006): Derivational Complexity of Knuth-Bendix Orders Revisited.
    In: Hermann, Miki; Voronkov, Andrei: Logic for Programming, Artificial Intelligence, and Reasoning. 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 4246)., ISBN 978-3540482819, pp. 75 - 89.

Academic Activities and Achievements 2006

Supervision of Student Theses

  • Moser, Georg: Sternagel, Christian: Logics with Transfinite Sequences (2005 - 2006).