Pages that link to "Item:Q1056745"

The following pages link to The modal logic of provability. The sequential approach (Q1056745):

Displaying 34 items.

• Cut elimination for GLS using the terminability of its regress process (Q288243) (← links)
• Modal interpolation via nested sequents (Q487689) (← links)
• On the proof-theory of two formalisations of modal first-order logic (Q622627) (← links)
• The bounded proof property via step algebras and step frames (Q741087) (← links)
• The modal logic of provability: cut-elimination (Q790809) (← links)
• Modal tableau calculi and interpolation (Q798647) (← links)
• On some proof theoretical properties of the modal logic GL (Q798649) (← links)
• Proof analysis in modal logic (Q812101) (← links)
• An epistemic logic for becoming informed (Q833038) (← links)
• Uniform interpolation and propositional quantifiers in modal logics (Q878154) (← links)
• Formal topological characterizations of various continuous domains (Q1004687) (← links)
• Provability: The emergence of a mathematical modality (Q1176093) (← links)
• Syntactical results on the arithmetical completeness of modal logic (Q1319362) (← links)
• The fixed point property in modal logic (Q1409307) (← links)
• Cut-elimination for weak Grzegorczyk logic Go (Q2016062) (← links)
• Interpolation properties for Sacchetti's logics (Q2097057) (← links)
• Effectively constructible fixed points in Sacchetti's modal logics of provability (Q2134275) (← links)
• Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq (Q2142084) (← links)
• A proof theory for the logic of provability in true arithmetic (Q2193977) (← links)
• Circular proofs for the Gödel-Löb provability logic (Q2343897) (← links)
• Note on some fixed point constructions in provability logic (Q2499296) (← links)
• VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED (Q2890695) (← links)
• A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs (Q2957670) (← links)
• A realization theorem for the Gödel-Löb provability logic (Q2957859) (← links)
• Kripke Semantics for Basic Sequent Systems (Q3010359) (← links)
• Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
• The Henkin Sentence (Q3454817) (← links)
• The Method of Tree-Hypersequents for Modal Propositional Logic (Q3600562) (← links)
• Provability in finite subtheories of PA and relative interpretability: a modal investigation (Q3760515) (← links)
• Polynomially and superexponentially shorter proofs in fragments of arithmetic (Q4032866) (← links)
• A formalization of Sambins's normalization for GL (Q4304806) (← links)
• 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03 (Q4678940) (← links)
• (Q5119390) (← links)
• Proof-theoretic results of common sense modal predicate calculi (Q6601690) (← links)