Abstract: Circular proofs, introduced by Daniyar Shamkanov, are proofs in which assumptions are allowed that are not axioms but do appear at least twice along a branch. Shamkanov has shown that a formula belongs to the provability logic GL exactly if it has a circular proof in the modal logic K4. Shamkanov uses Tait style proof systems and infinitary proofs. In this paper we prove the same result but then for sequent calculi and without the detour via infinitary systems. We also obtain a mild generalisation of the result, implying that its intuitionistic analogue holds as well.
Recommendations
Cited in
(12)- Interpolation properties for Sacchetti's logics
- Circular (yet sound) proofs
- Circular proofs for the Gödel-Löb provability logic
- Solovay-type theorems for circular definitions
- NON–WELL-FOUNDED DERIVATIONS IN THE GÖDEL-LÖB PROVABILITY LOGIC
- Analytic calculi for circular concepts by finite revision
- scientific article; zbMATH DE number 2087442 (Why is no real title available?)
- NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 12--17, 2023
- Intuitionistic Gödel-Löb logic, à la Simpson: labelled systems and birelational semantics
- Intuitionistic -calculus with the Lewis arrow
- On structural proof theory of the modal logic \(\mathsf{K}^+\) extended with infinitary derivations
This page was built for publication: Reasoning in circles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224693)
