Logica Universalis 1 (1):41-70 (2007)
. The paper presents a method for transforming a given sound and complete n-sequent proof system into an equivalent sound and complete system of ordinary sequents. The method is applicable to a large, central class of (generalized) finite-valued logics with the language satisfying a certain minimal expressiveness condition. The expressiveness condition decrees that the truth-value of any formula φ must be identifiable by determining whether certain formulas uniformly constructed from φ have designated values or not. The transformation preserves the general structure of proofs in the original calculus in a way ensuring preservation of the weak cut elimination theorem under the transformation. The described transformation metod is illustrated on several concrete examples of many-valued logics, including a new application to information sources logics.
|Keywords||Finite-valued logic n-sequent systems ordinary system calculi soundness completeness non-deterministic matrices cut elimination|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Labeled Calculi and Finite-Valued Logics.Matthias Baaz, Christian G. Fermüller, Gernot Salzer & Richard Zach - 1998 - Studia Logica 61 (1):7-33.
Many-Place Sequent Calculi for Finitely-Valued Logics.Alexej P. Pynko - 2010 - Logica Universalis 4 (1):41-66.
Cut-Free Tableau Calculi for Some Propositional Normal Modal Logics.Martin Amerbauer - 1996 - Studia Logica 57 (2-3):359 - 372.
Distributive-Lattice Semantics of Sequent Calculi with Structural Rules.Alexej P. Pynko - 2009 - Logica Universalis 3 (1):59-94.
Multi-Valued Calculi for Logics Based on Non-Determinism.Arnon Avron & Beata Konikowska - 2005 - Logic Journal of the IGPL 13 (4):365-387.
Added to index2009-01-28
Total downloads27 ( #185,551 of 2,154,085 )
Recent downloads (6 months)1 ( #398,005 of 2,154,085 )
How can I increase my downloads?