Pages that link to "Item:Q3914957"

The following pages link to On the proof theory of the modal logic for arithmetic provability (Q3914957):

Displaying 17 items.

• A cut-free sequential system for the propositional modal logic of finite chains (Q585187) (← links)
• On the proof-theory of two formalisations of modal first-order logic (Q622627) (← 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)
• The modal logic of provability. The sequential approach (Q1056745) (← links)
• Circular proofs for the Gödel-Löb provability logic (Q2343897) (← links)
• The closed fragment of IL is PSPACE hard (Q2825406) (← links)
• Valentini's cut-elimination for provability logic resolved (Q2890695) (← links)
• A realization theorem for the Gödel-Löb provability logic (Q2957859) (← links)
• Machine Checking Proof Theory: An Application of Logic to Logic (Q3601798) (← links)
• 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03 (Q4678940) (← links)
• (Q5119390) (← links)
• A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY (Q5850981) (← links)
• Provability multilattice logic (Q6040535) (← links)
• Proof-theoretic results of common sense modal predicate calculi (Q6601690) (← links)