Although the prime object of study for structural proof theory is proof calculi (especially analytic ones), it has many applications to important logical properties, such as conservativity, consistency, decidability, complexity, interpolation, etc. In my talk, I will present some recent successes in solving long-time open problems by proof-theoretic means, including the Lyndon interpolation property for Gödel logic (intermediate logic of linear frames) and the decidability of (bimodal) intuitionistic S4.
en
Project title:
Reasoning about Knowledge in Byzantine Distributed Systems: P 33600-N (FWF - Österr. Wissenschaftsfonds)
-
Research Areas:
Computer Engineering and Software-Intensive Systems: 100%
