Cut-Elimination for the Modal Grzegorczyk Logic via Non-well-founded Proofs

@inproceedings{Savateev2017CutEliminationFT,
  title={Cut-Elimination for the Modal Grzegorczyk Logic via Non-well-founded Proofs},
  author={Yury Savateev and Daniyar S. Shamkanov},
  booktitle={WoLLIC},
  year={2017}
}
We present a sequent calculus for the modal Grzegorczyk logic Grz allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs. 
Non-Well-Founded Proofs for the Grzegorczyk Modal Logic
We present a sequent calculus for the Grzegorczyk modal logic Grz allowing cyclic and other non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous
A pr 2 01 8 Cut Elimination for Weak Modal Grzegorczyk Logic via Non-Well-Founded Proofs
We present a sequent calculus for the weak Grzegorczyk logic Go allowing non-wellfounded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping
NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC
TLDR
A sequent calculus for the Grzegorczyk modal logic is presented, allowing cyclic and other non-well-founded proofs and obtaining the cut-elimination theorem for it by constructing a continuous cut-Elimination mapping acting on these proofs.
The Lambek Calculus with Iteration: Two Variants
TLDR
It is shown that, in contrast with the case without division operations (considered by Kozen), the first system is strictly stronger than the second one and is not recursively enumerable and cannot be described by a calculus with finite derivations.
Logic, Language, Information, and Computation
TLDR
Bounds on the computational strength of functions that graph Turing machines can compute are given and the study of the relationship between the computational power of a graph Turing machine and structural properties of its underlying graph is begun.

References

SHOWING 1-10 OF 17 REFERENCES
Non-Well-Founded Proofs for the Grzegorczyk Modal Logic
We present a sequent calculus for the Grzegorczyk modal logic Grz allowing cyclic and other non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous
Cut-elimination for Weak Grzegorczyk Logic Go
TLDR
This is the first syntactic proof of cut-elimination for weak Grzegorczyk logic Go, requiring a deeper analysis of the derivation structures than the proofs for GL and Grz.
A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel-McKinsey-Tarski embedding
TLDR
A constructive proof of the faithfulness of the embedding of Int into Grz and hence a constructive decision procedure for Int are obtained.
A Unifying Approach to Recursive and Co-recursive Definitions
TLDR
This work proposes a general approach for systematically defining fixed points for a broad class of well given recursive definition, thus allowing for mixed recursive/corecursive definitions and the resulting theory is quite simple and hence it can be used broadly with a small, sustainable overhead on the user.
On Modal Systems Having Arithmetical Interpretations
  • A. Avron
  • Mathematics, Computer Science
    J. Symb. Log.
  • 1984
TLDR
It is shown that cut-elimination fails for QGL (the extension of GL to a language with quantifiers), and it is further shown that, despite this failure, QGL still has some of GL' s interesting properties (e.g., the disjunction property).
The Lyndon property and uniform interpolation over the Grzegorczyk logic
We consider versions of the interpolation property stronger than the Craig interpolation property and prove the Lyndon interpolation property for the Grzegorczyk logic and some of its extensions. We
On Modal Grzegorczyk Logic
TLDR
A short overview of results on the Grzegorczyk logic and its extensions is given, which found a modal formula G valid in all partially ordered frames with descending chain condition but not in all topological spaces.
Tableau Methods for Modal and Temporal Logics
TLDR
This chapter gives a systematic and unified introduction to tableau methods for automating deduction in modal and temporal logics and focuses on the propositional fragments restricted to a two-valued (classical) basis.
A fixed point theorem in non-Archimedean vector spaces
A mapping T defined on a normed linear space X and taking values in X is said to be contractive (nonexpansive) if whenever x and y are distinct points in X, IITx Tyll < lix yll (IITx Tyll < lix yVI).
Ultrametric Fixed Point Theorems and Applications
In this expository paper, we want to give an overview over the ultrametric xed point theorems and related results, entering also into their applications in various areas. In the beginning, let us
...
1
2
...