2021W

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

• An Abstract Form of the First Expsilon Theorem / M. Baaz, A. Lolic, A. Leitsch / Journal of Logic and Computation, 30 (2020), 8; 1447 - 1468
• Schematic Refutations of Formula Schemata / D. Cerna, A. Leitsch, A. Lolic / Journal of Automated Reasoning, online (2020)
• 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)
• 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
• Extraction of Expansion Trees / A. Lolic, A. Leitsch / Journal of Automated Reasoning, 61 (2018), 1; 1 - 38
• 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