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)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,360
External links
  •   Try with proxy.
  •   Try with proxy.
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA
    Similar books and articles
    Reinhard Muskens (1999). On Partial and Paraconsistent Logics. Notre Dame Journal of Formal Logic 40 (3):352-374.
    Analytics

    Monthly downloads

    Added to index

    2010-08-24

    Total downloads

    8 ( #138,649 of 1,089,053 )

    Recent downloads (6 months)

    1 ( #69,801 of 1,089,053 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.