Results 221 to 230 of about 118,936 (260)
Algebraic proofs of cut elimination
The Journal of Logic and Algebraic Programming, 2001 Jeremey Avigad. Algebraic Proofs of Cut Elimination.
Jeremy Avigad
exaly +2 more sources
On the elimination of quantifier-free cuts
Theoretical Computer Science, 2011 When investigating the complexity of cut-elimination in first-order logic, a natural subproblem is the elimination of quantifier-free cuts. So far, the problem has only been considered in the context of general cut-elimination, and the upper bounds that have been obtained are essentially double exponential. In this note, we observe that a method due to
Daniel Weller
exaly +5 more sources
Towards a Semantic Characterization of Cut-Elimination [PDF]
Studia Logica, 2006 An occurrence of the cut rule in a derivation is called reductive if either (i) both cut formulas are the principal formulas of logical rules, or (ii) one of the two cut formulas is a context formula of a rule other than the cut, or (iii) one of the two premises is an identity axiom (of the form \(X\Rightarrow X\)). Reductive cut-elimination for simple
Agata Ciabattoni, Kazushige Terui
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Cut-Elimination: Syntax and Semantics
Studia Logica, 2014This 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 Quantified Conditional Logic
Journal of Philosophical Logic, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christoph Benzmüller
exaly +3 more sources
Annals of Pure and Applied Logic, 2018
arXiv admin note: text overlap with arXiv:1508 ...
openaire +2 more sources
arXiv admin note: text overlap with arXiv:1508 ...
openaire +2 more sources
Cut Elimination in the Presence of Axioms
Bulletin of Symbolic Logic, 1998AbstractA 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
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 +2 more sources
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 +2 more sources
Stratification and cut-elimination
Journal of Symbolic Logic, 1991In 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