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)
DOI 10.1080/11663081.1999.10510956
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 55,955
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

A Theorem About Infinite-Valued Sentential Logic.Robert McNaughton - 1951 - Journal of Symbolic Logic 16 (1):1-13.
Algebraic Aspects of Deduction Theorems.Janusz Czelakowski - 1985 - Studia Logica 44 (4):369 - 387.
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

Add more citations

Similar books and articles

On Weak and Strong Interpolation in Algebraic Logics.Gábor Sági & Saharon Shelah - 2006 - Journal of Symbolic Logic 71 (1):104 - 118.
The Abstract Variable-Binding Calculus.Don Pigozzi & Antonino Salibra - 1995 - Studia Logica 55 (1):129 - 179.
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.
Cylindric Modal Logic.Yde Venema - 1995 - Journal of Symbolic Logic 60 (2):591-623.
A Completeness Theorem for Higher Order Logics.Gábor Sági - 2000 - Journal of Symbolic Logic 65 (2):857-884.


Added to PP index

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?


My notes