NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC

DOI10.1017/S1755020319000510zbMath1496.03086arXiv1804.00955OpenAlexW3038517329WikidataQ113857267 ScholiaQ113857267MaRDI QIDQ5001550

Daniyar Shamkanov, Yury Savateev

Publication date: 22 July 2021

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.00955

zbMATH Keywords

cut-eliminationGrzegorczyk logiccyclic proofsnon-well-founded proofsLyndon interpolation

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07)

Related Items (2)

A Sound Interpretation of Leśniewski's Epsilon in Modal Logic KTB ⋮ Abstract cyclic proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Lyndon property and uniform interpolation over the Grzegorczyk logic
• The Banach fixed point theorem for ultrametric spaces
• Denotational semantics in the cpo and metric approach
• The Lambek calculus with iteration: two variants
• Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs
• Circular proofs for the Gödel-Löb provability logic
• A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel–McKinsey–Tarski embedding
• Cyclic Arithmetic Is Equivalent to Peano Arithmetic
• On modal systems having arithmetical interpretations
• On the Proof Theory of the Modal Logic Grz
• A Fixed Point Theorem in Non-Archimedean Vector Spaces
• Reasoning in circles
• An introduction to metric semantics: Operational and denotational models for programming and specification languages

This page was built for publication: NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC