Tim Lyon
Aus International Center for Computational Logic
Dr. Tim Lyon
Wissenschaftlicher Mitarbeiter Computational Logic
I am a postdoctoral researcher in the Computational Logic group at Technische Universität Dresden. I previously worked within the ERC project DeciGUT. My research interests concern the construction and application of (non-)wellfounded proof systems for fragments of first-order logic, non-classical logics, modal logics, and fixed-point logics. Prior to joining TU Dresden, I was a PhD student at Technische Universität Wien, where I worked on the TICAMORE (Translating and Discovering Calculi for Modal and Related Logics) project under the supervision of Prof. Agata Ciabattoni.
Neueste Publikationen
Komplette Publikationsliste anzeigen
Tim Lyon, Omar Taher
Optimizing Proof-Search via Linearization for Gödel-Löb Logic with Tree-Hypersequents
In Giorgio Bacci and Mickaël Randour, eds., Proceedings Seventeenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2026), volume 454, 148-164, 2026. Electronic Proceedings in Theoretical Computer Science
Details
Tim Lyon, Lukas Zenger
Non-Wellfounded and Cyclic Proofs for LTL: A Syntactic Correspondence with Linear Nested Sequents
In Giorgio Bacci and Mickaël Randour, eds., Proceedings Seventeenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2026), volume 454, 165-182, 2026. Electronic Proceedings in Theoretical Computer Science
Details
Tim Lyon, Lukas Zenger
Non-Wellfounded and Cyclic Proofs for LTL: A Syntactic Correspondence with Linear Nested Sequents
Technical Report, TU Dresden, 2026
Details Download
Tim Lyon, Piotr Ostropolski-Nalewaja
Foundations for an Abstract Proof Theory in the Context of Horn Rules
ACM Transactions on Computational Logic, 27(4), October 2026
Details
Tim Lyon, Ian Shillito, Alwen Tiu
Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents
In Jörg Endrullis, Sylvain Schmitz, eds., Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic 2025, volume 326 of LIPIcs, 2025. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Details Download
Tim Lyon
Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations
In Jörg Endrullis, Sylvain Schmitz, eds., Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic 2025, volume 326 of LIPIcs, 2025. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Details Download
Tim Lyon
On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic
In Hossein Hojjat, Georgiana Caltais, eds., Proceedings of the Eleventh International Conference on Fundamentals of Software Engineering (FSEN), volume 15593 of LNCS, 113-119, 2025. Springer
Details Download
Tim Lyon, Agata Ciabattoni, Didier Galmiche, Marianna Girlando, Dominique Larchey-Wendling, Daniel Méry, Nicola Olivetti, Revantha Ramanayake
Internal and External Calculi: Ordering the Jungle without Being Lost in Translations
Bulletin of the Section of Logic, 54(1):59–151, 2025
Details Download
Omar Taher, Tim Lyon
Automated Proof-Search for Gödel-Löb Provability Logic via Tree Sequents
Technical Report, TU Dresden, 2025
Details Download
Thomas Feller, Tim Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
Decidability of Querying First-Order Theories via Countermodels of Finite Width
Logical Methods in Computer Science, 21(2):7:1-7:35, April 2025
Details Download
Lehrveranstaltungen
- Proof Theory and Sequent Systems (WS 2026)
- Advanced Problem Solving and Search (WS 2026)
- Proof Theory and Sequent Systems (SS 2026)
- Proof Theory and Sequent Systems (WS 2025)
- Proof Theory and Sequent Systems (SS 2024)
Themenvorschläge für Studien- und Abschlussarbeiten
- Master's Thesis Projects in Symbolic Logic, Proof Theory, and Theorem Proving
- Betreuer: Tim Lyon
- Verfügbar als Thema einer Masterarbeit
Abgeschlossene Arbeiten
- Automated Proof-Search for Gödel-Löb Provability Logic via Tree Sequents
- von Omar Y. A. A. Taher (12 September 2025)
- Betreuer: Tim Lyon
