Results 241 to 250 of about 1,069,887 (282)

Multi-focused cut elimination

Mathematical Structures in Computer Science, 2017
We investigate cut elimination in multi-focused sequent calculi and the impact on the cut elimination proof of design choices in such calculi. The particular design we advocate is illustrated by a multi-focused calculus for full linear logic using an explicitly polarised syntax and incremental focus handling, for which we provide a syntactic cut ...
Taus Brock-Nannestad, Nicolas Guenot
openaire   +2 more sources

Methods of Cut-Elimination

, 2011
This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs ...
Alexander Leitsch, Matthias Baaz
exaly   +3 more sources

Cut-Elimination: Experiments with CERES

, 2005
Cut-elimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cut-elimination method CERES (cut-elimination by resolution) works by constructing a set of clauses from a proof with cuts.
Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr   +4 more
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Cut Elimination for S4C: A Case Study

Studia Logica, 2006
The paper contains a cut-elimination proof for a logic of continuous transformations of a topological space, called S4C [cf. \textit{P. Kremer} and \textit{G. Mints}, Ann. Pure Appl. Logic 131, No. 1--3, 133--158 (2005; Zbl 1067.03028)]. It consists of the modal logic S4 enlarged by another modality operator \(\circ\). In the intended models of dynamic
Grigori Mints
exaly   +3 more sources

Corrected upper bounds for free-cut elimination [PDF]

Theoretical Computer Science, 2011
Free-cut elimination allows cut elimination to be carried out in the presence of non-logical axioms. Formulas in a proof are anchored provided they originate in a non-logical axiom or non-logical inference.
Arnold Beckmann, Samuel R Buss
exaly   +2 more sources

Cut-Elimination: Syntax and Semantics

Studia Logica, 2014
This article concerns the cut-elimination by resolution (CERES) method for first-order logic [\textit{M. Baaz} et al., Lect. Notes Comput. Sci. 3452, 481--495 (2005; Zbl 1108.03305)]. Compared with reductive cut-elimination (e.g.\ Gentzen-/Schütte-/Tait-style) which can be viewed as sequences of local reductions, CERES operates globally on LK-proofs ...
Matthias Baaz, Alexander Leitsch
openaire   +1 more source

Cut Elimination in the Presence of Axioms

Bulletin of Symbolic Logic, 1998
AbstractA way is found to add axioms to sequent calculi that maintains the eliminability of cut, through the representation of axioms as rules of inference of a suitable form. By this method, the structural analysis of proofs is extended from pure logic to free-variable theories, covering all classical theories, and a wide class of constructive ...
Sara Negri, Jan von Plato
openaire   +3 more sources

Cut-elimination for ω1

Annals of Pure and Applied Logic, 2018
arXiv admin note: text overlap with arXiv:1508 ...
openaire   +2 more sources

Stratification and cut-elimination

Journal of Symbolic Logic, 1991
In this paper, we show the normalization of proofs of NF (Quine's New Foundations; see [15]) minus extensionality. This system, called SF (Stratified Foundations) differs in many respects from the associated system of simple type theory. It is written in a first order language and not in a multi-sorted one, and the formulas need not be stratifiable ...
openaire   +1 more source

Cut elimination for entailment relations

Archive for Mathematical Logic, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Davide Rinaldi, Daniel Misselbeck-Wessel
openaire   +3 more sources