Limits for Paraconsistent Calculi

Notre Dame Journal of Formal Logic 40 (3):375-390 (1999)
Abstract
This paper discusses how to define logics as deductive limits of sequences of other logics. The case of da Costa's hierarchy of increasingly weaker paraconsistent calculi, known as $ \mathcal {C}$n, 1 $ \leq$ n $ \leq$ $ \omega$, is carefully studied. The calculus $ \mathcal {C}$$\scriptstyle \omega$, in particular, constitutes no more than a lower deductive bound to this hierarchy and differs considerably from its companions. A long standing problem in the literature (open for more than 35 years) is to define the deductive limit to this hierarchy, that is, its greatest lower deductive bound. The calculus $ \mathcal {C}$min, stronger than $ \mathcal {C}$$\scriptstyle \omega$, is first presented as a step toward this limit. As an alternative to the bivaluation semantics of $ \mathcal {C}$min presented thereupon, possible-translations semantics are then introduced and suggested as the standard technique both to give this calculus a more reasonable semantics and to derive some interesting properties about it. Possible-translations semantics are then used to provide both a semantics and a decision procedure for $ \mathcal {C}$Lim, the real deductive limit of da Costa's hierarchy. Possible-translations semantics also make it possible to characterize a precise sense of duality: as an example, $ \mathcal {D}$min is proposed as the dual to $ \mathcal {C}$min.
Keywords hyerarchies of paraconsistent logics
Categories (categorize this paper)
DOI 10.1305/ndjfl/1022615617
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,848
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
A Hierarchy of Weak Double Negations.Norihiro Kamide - 2013 - Studia Logica 101 (6):1277-1297.
Paraconsistent Logic.David Ripley - forthcoming - Journal of Philosophical Logic:1-10.

View all 7 citations / Add more citations

Similar books and articles
Classical Modal De Morgan Algebras.Sergio A. Celani - 2011 - Studia Logica 98 (1-2):251-266.
Semi-Intuitionistic Logic.Juan Manuel Cornejo - 2011 - Studia Logica 98 (1-2):9-25.
On Partial and Paraconsistent Logics.Reinhard Muskens - 1999 - Notre Dame Journal of Formal Logic 40 (3):352-374.
Ideal Paraconsistent Logics.O. Arieli, A. Avron & A. Zamansky - 2011 - Studia Logica 99 (1-3):31-60.
Yes, Virginia, There Really Are Paraconsistent Logics.Bryson Brown - 1999 - Journal of Philosophical Logic 28 (5):489-500.
Added to PP index
2010-08-24

Total downloads
25 ( #221,906 of 2,210,503 )

Recent downloads (6 months)
2 ( #225,618 of 2,210,503 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature