Results 201 to 210 of about 2,682,535 (254)
Some of the next articles are maybe not open access.
2010
Our aim is to compare different methods of cut-elimination. For this aim we need logic-free axioms. The original formulation of LK by Gentzen also served the purpose of simulating Hilbert-type calculi and deriving axiom schemata within fixed proof length. Below we show that there exists a polynomial transformation from an LK-proof with arbitrary axioms
Matthias Baaz, Alexander Leitsch
openaire +1 more source
Our aim is to compare different methods of cut-elimination. For this aim we need logic-free axioms. The original formulation of LK by Gentzen also served the purpose of simulating Hilbert-type calculi and deriving axiom schemata within fixed proof length. Below we show that there exists a polynomial transformation from an LK-proof with arbitrary axioms
Matthias Baaz, Alexander Leitsch
openaire +1 more source
A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense Logic
International Conference on Theorem Proving with Analytic Tableaux and Related Methods, 2021Caitlin D'Abrera, J. Dawson, R. Goré
semanticscholar +1 more source
CUT ELIMINATION FOR CLASSICAL BILINEAR LOGIC
Fundamenta Informaticae, 1995In this paper a cut elimination theorem is proved for classical non-commutative linear logic without exponentials, presented as a dual Schütte style deductive system. The notion of equality between deductions is sketched and they are interpreted as relations, in the spirit of the formulas as types paradigm.
openaire +2 more sources
Cut elimination with applications
2000The “applications of cut elimination” in the title of this chapter may perhaps be described more appropriately as “applications of cutfree systems”, since the applications are obtained by analyzing the structure of cutfree proofs; and in order to prove that the various cutfree systems are adequate for our standard logics all we need to know is that ...
openaire +1 more source
Simulation, Theory, and Cut Elimination
Monist, 1999This paper is concerned with the contrast between simulation- and deduction-based approaches to reasoning about physical objects. We show that linear logic can give a unified account of both simulation and deduction concerning physical objects; it also allows us to draw a principled distinction between simulation and deduction, since simulations ...
openaire +1 more source
Fast cut-elimination by projection
1997The 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
1999
Preface. Introduction. 1. Categories. 2. Functors. 3. Natural Transformations. 4. Adjunctions. 5. Comonads. 6. Cartesian Categories. Conclusion. References. Index.
openaire +1 more source
Preface. Introduction. 1. Categories. 2. Functors. 3. Natural Transformations. 4. Adjunctions. 5. Comonads. 6. Cartesian Categories. Conclusion. References. Index.
openaire +1 more source
Failure of cut-elimination in cyclic proofs of separation logic
, 2020D. Kimura +3 more
semanticscholar +1 more source
Normalizability, cut eliminability and paradox
Synthese, 2016This is a reply to the considerations advanced by Schroeder-Heister and Tranchini (Ekman’s paradox, Unpublished typescript) as prima facie problematic for the proof-theoretic criterion of paradoxicality, as originally presented in Tennant (Dialectica 36:265–296, 1982) and subsequently amended in Tennant (Analysis 55:199–207, 1995).
openaire +1 more source