Automated Proof-Search for Gödel-Löb Provability Logic via Tree Sequents

PublikationenPublications

• Nach AutorBy Author
  • Tim LyonTim Lyon
• Nach ForschungsgruppeBy Research Group
  • Computational LogicComputational Logic

Toggle side column

Automated Proof-Search for Gödel-Löb Provability Logic via Tree Sequents

Omar TaherOmar Taher,  Tim LyonTim Lyon

• Download

Omar Taher, Tim Lyon
Automated Proof-Search for Gödel-Löb Provability Logic via Tree Sequents
Technical Report, TU Dresden, 2025

• Details
• Bibtex

• KurzfassungAbstract
  This paper introduces an EXPTIME decision procedure for the (in)validity of Gödel-Löb Provability Logic via a syntactic variant of the Tree-Hypersequent System CSGL.
• Bemerkung: Note: Report from Master's Project
• Forschungsgruppe:Research Group: Computational LogicComputational Logic

@techreport{TL2025,
  author      = {Omar Taher and Tim Lyon},
  title       = {Automated Proof-Search for G{\"{o}}del-L{\"{o}}b Provability
                 Logic via Tree Sequents},
  institution = {TU Dresden},
  year        = {2025}
}