Results 151 to 160 of about 578,113 (185)
Some of the next articles are maybe not open access.
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
Cut-Elimination for Quantified Conditional Logic
Journal of Philosophical Logic, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
Cut-Elimination and Proof Schemata
2015By Gentzen's famous Hauptsatz the cut-elimination theorem every proof in sequent calculus for first-order logic with cuts can be transformed into a cut-free proof; cut-free proofs are analytic and consist entirely of syntactic material of the end-sequent the proven theorem.
Cvetan Dunchev +3 more
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
Cut Elimination for Sequent Systems
2019Cut elimination for a given sequent system \(\mathbf L\) means that if a sequent is provable in \(\mathbf L\) then it is also provable in \(\mathbf L\) without using cut rule. Any proof P of \(\mathbf L\) is said to be cut-free when P contains any application of cut rule in it.
openaire +1 more source