Results 251 to 260 of about 117,954 (285)

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, Mints Grigori
exaly   +3 more sources

Corrected upper bounds for free-cut elimination

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 for ω1

Annals of Pure and Applied Logic, 2018
arXiv admin note: text overlap with arXiv:1508 ...
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   +2 more sources

Don't eliminate cut

Journal of Philosophical Logic, 1984
Semantic tableau methods are sometimes used in logic courses because they produce derivations of various formulas of first order logic in a straightforward way. The feasibility of these tableau methods depends, however, on the formulas to which they are applied.
openaire   +1 more source

Towards a clausal analysis of cut-elimination

Journal of Symbolic Computation, 2006
In this paper we show that a large class of cut-elimination methods can be analysed by clause terms representing sets of characteristic clauses extractable from the original proof.
Matthias Baaz, Alexander Leitsch
exaly   +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   +2 more sources

Fast cut-elimination by projection

1997
The methods of this paper can be applied as well to intuitionistic proof systems like Natural Deduction. It is obvious that the application of extended reductions similar to projections will result in a loss of confluence; on the other hand, confluence is of doubtful value if the complexity of cut-elimination is the main concern.
Matthias Baaz, Alexander Leitsch
openaire   +1 more source