2020W

• Bachelor Thesis / PR / 184.691
• Data Base Systems / VU / 184.686
• Data Modelling / VU / 184.685
• Formal Methods in Computer Science / UE / 185.A93
• Project in Computer Science 1 / PR / 184.688
• Project in Computer Science 2 / PR / 184.689

• Extraction of Expansion Trees / A. Lolic, A. Leitsch / Journal of Automated Reasoning, 62 (2019), 3; 393 - 430
• Schematic Refutations of Formula Schemata / D. Cerna, A. Leitsch, A. Lolic / ArXiv, 1902.08055 (2019)
• Extraction of Expansion Trees / A. Lolic, A. Leitsch / Journal of Automated Reasoning, 61 (2018), 1; 1 - 38
• A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem / A. Leitsch, M. Baaz, A. Lolic / Keynote Lecture: Logical Foundations of Computer Science - International Symposium, LFCS 2018, Florida (invited); 2018-01-08 - 2018-01-11; in: "LNCS 10703", Springer International Publishing AG, 10703 (2018), 55 - 71
• Expansion Trees from Non-Normalized Proofs with CERES / A. Lolic, A. Leitsch / Talk: Collegium Logicum Proof Theory: Herbrand's Theorem Revisited, Wien; 2017-05-25 - 2017-05-27