Pages that link to "Item:Q2193977"

The following pages link to A proof theory for the logic of provability in true arithmetic (Q2193977):

Displaying 15 items.

• The modal logic of Gödel sentences (Q600852) (← links)
• The modal logic of provability: cut-elimination (Q790809) (← links)
• A new proof of the fixed-point theorem of provability logic (Q923072) (← links)
• The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic (Q1068069) (← links)
• Sequent logic of arithmetic decidability (Q1866903) (← links)
• Proof-theoretic modal PA-completeness. II: The syntactic countermodel (Q1970646) (← links)
• A self-contained provability calculus for \(\varGamma_0\) (Q2303588) (← links)
• From Coinductive Proofs to Exact Real Arithmetic (Q3644745) (← links)
• (Q3757914) (← links)
• PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC (Q4295253) (← links)
• Universal Induction and True Universal Arithmetic (Q4304155) (← links)
• (Q4325775) (← links)
• Reduction of provability logics to Σ₁-provability logics (Q4644602) (← links)
• AXIOMATIZATION OF PROVABLE n-PROVABILITY (Q5222538) (← links)
• A modification of Visser's formal logic and its connection with Solovay's modal logic (Q6548996) (← links)