Pages that link to "Item:Q2510758"
From MaRDI portal
The following pages link to A simplified proof of arithmetical completeness theorem for provability logic GLP (Q2510758):
Displaying 12 items.
- Positive provability logic for uniform reflection principles (Q392274) (← links)
- On provability logics with linearly ordered modalities (Q456968) (← links)
- On the complexity of the closed fragment of Japaridze's provability logic (Q482919) (← links)
- Kripke semantics for provability logic GLP (Q636316) (← links)
- A simplification of the completeness proofs for Guaspari and Solovay's R (Q923070) (← links)
- The omega-rule interpretation of transfinite provability logic (Q1694812) (← links)
- On the reduction property for GLP-algebras (Q2358595) (← links)
- Interpolation properties for provability logics GL and GLP (Q2510774) (← links)
- A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs (Q2957670) (← links)
- Derived topologies on ordinals and stationary reflection (Q4644955) (← links)
- A many-sorted variant of Japaridze’s polymodal provability logic (Q5095650) (← links)
- Topological Interpretations of Provability Logic (Q5255798) (← links)
