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

From International Center for Computational Logic
Toggle side column

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

project thesis by Omar Y. A. A. Taher
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.