Logica Universalis 1 (1):41-70 (2007)

Authors
Arnon Avron
Tel Aviv University
Abstract
.  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)
DOI 10.1007/s11787-006-0003-6
Options
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: 71,259
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

Add more references

Citations of this work BETA

Not a Knot.Paula Teijeiro - 2020 - Thought: A Journal of Philosophy 9 (1):14-24.
Exactly True and Non-Falsity Logics Meeting Infectious Ones.Alex Belikov & Yaroslav Petrukhin - 2020 - Journal of Applied Non-Classical Logics 30 (2):93-122.

View all 16 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
83 ( #141,503 of 2,518,488 )

Recent downloads (6 months)
1 ( #408,186 of 2,518,488 )

How can I increase my downloads?

Downloads

My notes