arXiv (All)
open access
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. We work with a not
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Proof that Wittgenstein is correct about Gödel#757828
- Hierarchical Correctness Proofs for Distributed Algorithms#472207
- Automating Reasoning with Standpoint Logic via Nested Sequents#101504
- MechMath: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving#614966
- MechMath: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving#613999
Record · ID 1326302
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive