Stefan Hetzl - Teaching

On this page you can find some information about my teaching and supervision activities including links and material for download. For a complete listing of current courses, please consult my TISS page. I can offer student projects, master's theses, and Ph.D. theses on various topics connected to my research interests. If you want more specific information, do not hesitate to contact me.

General

• Stellungnahme zur Lernergebnisorientierung (in German)
• Statement der Konferenz der Senatsvorsitzenden der österreichischen Universitäten zur UG-Novelle (in German)

Lectures

• Diskrete und geometrische Algorithmen (winter terms 2018/19, 2020/21, 2022/23), lecture notes (in German)
• Gödel's Incompleteness Theorems (summer terms 2018, 2020, 2022), lecture notes
• Automata and Formal Languages (winter terms 2015/16, 2016/17, summer terms 2019, 2021, 2023), lecture notes
• Theoretische Informatik (summer terms 2014-2019, 2021) lecture notes (in German)
• Automated Deduction (summer terms 2015, 2016)
• Higher-Order Logic (summer terms 2012, 2013), lecture notes
• Mathematical Logic 2 (summer terms 2009, 2011)
• Proof Theory of Induction (2018), International Summer School for Proof Theory in First-Order Logic, slides
• Automata and Formal Lanuage Theory (2013), Ninth International Tbilisi Summer School in Logic and Language, slides
• Complexity of Algorithms (2011), Seventh International Tbilisi Summer School in Logic and Language, slides

Ph.D. Theses

• Jannik Vierling: The limits of automated inductive theorem provers, in progress [ pdf ]
• Sebastian Zivota: On formula equations and invariant generation, 2021
  [ pdf, UBTUW ]
• Gabriel Ebner: Inductive theorem proving using tree grammars, 2021
  [ pdf, UBTUW ]
• Simon Wolfsteiner: Grammatical Complexity of Finite Languages, 2020
  [ pdf, UBTUW ]

Master's Theses

• Fabian Achammer: Decidability of Diophantine equations in a theory adjacent to IOpen, 2023
  [ pdf ]
• Johannes Kloibhofer: A fixed-point theorem for Horn formula equations, 2020
  [ pdf, UBTUW ]
• Jannik Vierling: Cyclic superposition and induction, 2018
  [ pdf, UBTUW ]
• Hugo Moeneclaey: Expansion proofs for arithmetic, Stage M2, Master Parisien de Recherche en Informatique (MPRI), 2017
  [ pdf ]
• Andreas Humenberger: Abstract proof structures, 2016
  [ pdf, UBTUW ]
• Gabriel Ebner: Finding loop invariants using tree grammars, 2015
  [ pdf, UBTUW ]
• Bernhard Mallinger: Interpolation in first-order logic with equality, 2014
  [ pdf, UBTUW ]
• Sebastian Zivota: Cuts without quantifier alternations and their effect on expansion trees, 2014
  [ pdf, UBTUW ]

Bachelor's Theses

• Johannes Weiser: Varieties of rational languages and finite monoids, 2023
  [ pdf ]
• Leopold Fajtak: Programmextraktion mittels Gödels Dialectica Interpretation, 2022
  [ pdf ]
• Fabian Achammer: Eine Variante des DLS-Algorithmus zum Lösen von Formelgleichungen, 2020
  [ pdf ]
• Martin Gius: Die Unentscheidbarkeit der k-Beweisbarkeit, 2019
  [ pdf ]
• Markus Rinke: Die Kosten eines Zyklus sind ein Quadrat, 2019
  [ pdf ]

Interships

• Andreas Halkjær From: Spin - Superposition with Structural Induction, 2019, internship report
• Jannik Vierling: AIP's induction axioms, 2017
• Alexander Birch Jensen: gaptic - Tactic-language for proof formalization, 2016, internship report
• Janos Tapolczai: Cut Introduction - Cut-Formulas with Multiple Universal Quantifiers, 2014

Seminars

• Seminar (winter term 2022/23) on automata theory, seminar papers
• Seminar in logic (summer term 2022) on J. Krajíček: Proof Complexity, Cambridge University Press, 2019, seminar papers
• Seminar in logic (winter term 2020/21) on R. Kaye: Models of Peano Arithmetic, Oxford University Press, 1991, seminar papers
• Seminar in theoretical computer science (winter term 2019/20) on H. Straubing: Finite Automata, Formal Logic, and Circuit Complexity, Springer, 1994, seminar papers
• Seminar (summer term 2019) on proof theory, seminar papers
• Seminar (summer term 2018) on: N. Immerman: Descriptive Complexity, Springer, 1999, seminar papers