Results 11 to 20 of about 12,135 (97)

Proof Theory of Finite-valued Logics [PDF]

, 1993
The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux
Zach, Richard
core   +5 more sources

The Epsilon Calculus and Herbrand Complexity [PDF]

, 2005
Hilbert's epsilon-calculus is based on an extension of the language of predicate logic by a term-forming operator $\epsilon_{x}$. Two fundamental results about the epsilon-calculus, the first and second epsilon theorem, play a role similar to that which ...
A. Blass, A. Leisenring, A. MOSTOWSKI, D. DeViDi, D. Hilbert, G. Kreisel, G. Mints, G. Mints, Georg Moser, J. Avigad, J. L. Bell, J. L. Bell, J. Von Neumann, M. Baaz, M. Fitting, R. Zach, R. Zach, Richard Zach, V. P. Orevkov, W. Ackermann, W. Ackermann   +20 more
core   +2 more sources

Elimination of Cuts in First-order Finite-valued Logics [PDF]

, 1993
A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established.
Baaz, Matthias, Fermüller, Christian G., Zach, Richard   +2 more
core   +4 more sources

Quantifier elimination in quasianalytic structures via non-standard analysis [PDF]

, 2015
The paper is a continuation of our earlier article where we developed a theory of active and non-active infinitesimals and intended to establish quantifier elimination in quasianalytic structures.
Nowak, Krzysztof Jan
core   +1 more source

The Sequent Calculus of Skew Monoidal Categories [PDF]

, 2018
International ...
Uustalu, Tarmo, Veltri, Niccolò, Zeilberger, Noam   +2 more
core   +4 more sources

Proof Theory and Ordered Groups

, 2017
Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups).
A Ciabattoni, A Ciabattoni, A Clay, BH Neumann, EC Weinberg, F Montagna, G Metcalfe, G Metcalfe, GB Dantzig, K Terui, L Fuchs, LH Smith, ME Anderson, N Galatos, P Jipsen, R Cignoli, S Burris, VM Kopytov, WC Holland, WC Holland, WC Holland   +20 more
core   +1 more source

On Constructive Connectives and Systems [PDF]

, 2010
Canonical inference rules and canonical systems are defined in the framework of non-strict single-conclusion sequent systems, in which the succeedents of sequents can be empty.
Arnon Avron, Martin Giese, Ori Lahav
core   +1 more source

Systematic construction of natural deduction systems for many-valued logics [PDF]

, 1993
A construction principle for natural deduction systems for arbitrary, finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables
Baaz, Matthias, Fermüller, Christian G., Zach, Richard   +2 more
core   +2 more sources

Collection analysis for Horn clause programs [PDF]

, 2006
We consider approximating data structures with collections of the items that they contain. For examples, lists, binary trees, tuples, etc, can be approximated by sets or multisets of the items within them.
Miller, Dale
core   +4 more sources

Ecumenical modal logic

, 2020
The discussion about how to put together Gentzen's systems for classical and intuitionistic logic in a single unified system is back in fashion. Indeed, recently Prawitz and others have been discussing the so called Ecumenical Systems, where connectives ...
A Ciabattoni, C Liang, D Ilik, J Avigad, J Murzi, JM Andreoli, L Straßburger, P Maffezioli, P Schroeder-Heister   +8 more
core   +1 more source