Valentini's cut-elimination for provability logic resolved
From MaRDI portal
Publication:3086940
zbMATH Open1244.03158MaRDI QIDQ3086940FDOQ3086940
Authors: Rajeev Goré, Revantha Ramanayake
Publication date: 30 March 2011
Recommendations
- Valentini's cut-elimination for provability logic resolved
- A purely syntactic and cut-free sequent calculus for the modal logic of provability
- The modal logic of provability: cut-elimination
- Cut elimination for GLS using the terminability of its regress process
- scientific article; zbMATH DE number 7668109
Cut-elimination and normal-form theorems (03F05) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Cited In (6)
- Cut elimination for GLS using the terminability of its regress process
- Cut-elimination for weak Grzegorczyk logic Go
- Valentini's cut-elimination for provability logic resolved
- Machine Checking Proof Theory: An Application of Logic to Logic
- The bounded proof property via step algebras and step frames
- Machine-checked proof-theory for propositional modal logics
This page was built for publication: Valentini's cut-elimination for provability logic resolved
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086940)