Quasi-canonical systems and their semantics

Synthese:1-19 (forthcoming)
Abstract
A canonical Gentzen-type system is a system in which every rule has the subformula property, it introduces exactly one occurrence of a connective, and it imposes no restrictions on the contexts of its applications. A larger class of Gentzen-type systems which is also extensively in use is that of quasi-canonical systems. In such systems a special role is given to a unary connective \ of the language. Accordingly, each application of a logical rule in such systems introduces either a formula of the form \\), or of the form \\), and all the active formulas of its premises belong to the set \. In this paper we investigate the whole class of quasi-canonical systems. We provide a constructive coherence criterion for such systems, and show that a quasi-canonical system is coherent iff it is analytic iff it has a characteristic non-deterministic matrix which is based on some subset of the set of the four truth-values which are used in the famous Dunn–Belnap four-valued matrix for information processing. In addition, we determine when a quasi-canonical system admits cut-elimination.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/s11229-018-02045-0
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 36,555
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

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Paraconsistency, Paracompleteness, Gentzen Systems, and Trivalent Semantics.Arnon Avron - 2014 - Journal of Applied Non-Classical Logics 24 (1-2):12-34.
Quasi-Modal Equivalence of Canonical Structures.Robert Goldblatt - 2001 - Journal of Symbolic Logic 66 (2):497-508.
Quasi-Modal Equivalence of Canonical Structures.Robert Goldblatt - 2001 - Journal of Symbolic Logic 66 (2):497-508.
Subformula Semantics for Strong Negation Systems.Seiki Akama - 1990 - Journal of Philosophical Logic 19 (2):217 - 226.
Canonical Rules.Emil Jeřábek - 2009 - Journal of Symbolic Logic 74 (4):1171 - 1205.
Well (and Better) Quasi-Ordered Transition Systems.Parosh Aziz Abdulla - 2010 - Bulletin of Symbolic Logic 16 (4):457-515.

Analytics

Added to PP index
2018-12-08

Total downloads
2 ( #960,749 of 2,302,572 )

Recent downloads (6 months)
2 ( #273,859 of 2,302,572 )

How can I increase my downloads?

Monthly downloads

Sorry, there are not enough data points to plot this chart.

My notes

Sign in to use this feature