Omar Taher

Optimizing Proof-Search via Linearization for Gödel-Löb Logic with Tree-Hypersequents

We answer a question posed by Poggiolesi concerning a syntactic decidability proof for GL in the tree-hypersequent system CSGL, and resolve a challenge identified by Maggesi and Perini Brogi, who sought a PSPACE proof-search algorithm for GL in expressive sequent-based formalisms...