Journal of Applied Non-Classical Logics 9 (1):9-36 (1999)
Abstract |
ABSTRACT In this paper we study consequence relations on the set of many sided sequents over a propositional language. We deal with the consequence relations axiomatized by the sequent calculi defined in [2] and associated with arbitrary finite algebras. These consequence relations are examples of what we call Gentzen systems. We define a semantics for these systems and prove a Strong Completeness Theorem, which is an extension of the Completeness Theorem for provable sequents stated in [2]. For the special case of the finite linear MV-algebras, the Strong Completeness Theorem was proved in [10], as a consequence of McNaughton's Theorem. The main tool to prove this result for arbitrary algebras is the deduction-detachment theorem for Gentzen systems.
|
Keywords | No keywords specified (fix it) |
Categories | (categorize this paper) |
ISBN(s) | |
DOI | 10.1080/11663081.1999.10510956 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
A Theorem About Infinite-Valued Sentential Logic.Robert McNaughton - 1951 - Journal of Symbolic Logic 16 (1):1-13.
Theory of Logical Calculi. Basic Theory of Consequence Operations.R. Wojcicki - 1988 - Kluwer Academic Publishers.
Elimination of Cuts in First-Order Finite-Valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1994 - Journal of Information Processing and Cybernetics EIK 29 (6):333-355.
View all 7 references / Add more references
Citations of this work BETA
On Gentzen Relations Associated with Finite-Valued Logics Preserving Degrees of Truth.Angel J. Gil - 2013 - Studia Logica 101 (4):749-781.
Similar books and articles
Algebraic Aspects of Cut Elimination.Francesco Belardinelli, Peter Jipsen & Hiroakira Ono - 2004 - Studia Logica 77 (2):209 - 240.
On the Infinite-Valued Łukasiewicz Logic That Preserves Degrees of Truth.Josep Maria Font, Àngel J. Gil, Antoni Torrens & Ventura Verdú - 2006 - Archive for Mathematical Logic 45 (7):839-868.
Finite Algebras of Relations Are Representable on Finite Sets.H. Andréka, I. Hodkinson & I. Németi - 1999 - Journal of Symbolic Logic 64 (1):243-267.
On Weak and Strong Interpolation in Algebraic Logics.Gábor Sági & Saharon Shelah - 2006 - Journal of Symbolic Logic 71 (1):104 - 118.
Completeness Theorem for Propositional Probabilistic Models Whose Measures Have Only Finite Ranges.Radosav Dordević, Miodrag Rašković & Zoran Ognjanović - 2004 - Archive for Mathematical Logic 43 (4):557-563.
A Characterization of MV-Algebras Free Over Finite Distributive Lattices.Vincenzo Marra - 2008 - Archive for Mathematical Logic 47 (3):263-276.
On the Standard and Rational Completeness of Some Axiomatic Extensions of the Monoidal T-Norm Logic.Francesc Esteva, Joan Gispert, Lluís Godo & Franco Montagna - 2002 - Studia Logica 71 (2):199 - 226.
The Abstract Variable-Binding Calculus.Don Pigozzi & Antonino Salibra - 1995 - Studia Logica 55 (1):129 - 179.
Information Completeness in Nelson Algebras of Rough Sets Induced by Quasiorders.Jouni Järvinen, Piero Pagliani & Sándor Radeleczki - 2013 - Studia Logica 101 (5):1073-1092.
Symmetrical Heyting Algebras with a Finite Order Type of Operators.Luisa Iturrioz - 1995 - Studia Logica 55 (1):89 - 98.
On Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.
Interpretability Over Peano Arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
A Completeness Theorem for Higher Order Logics.Gábor Sági - 2000 - Journal of Symbolic Logic 65 (2):857-884.
Analytics
Added to PP index
2014-01-21
Total views
22 ( #467,747 of 2,403,171 )
Recent downloads (6 months)
4 ( #198,051 of 2,403,171 )
2014-01-21
Total views
22 ( #467,747 of 2,403,171 )
Recent downloads (6 months)
4 ( #198,051 of 2,403,171 )
How can I increase my downloads?
Downloads