Switch to: Citations

Add references

You must login to add references.
  1. Nearly every normal modal logic is paranormal.Joao Marcos - 2005 - Logique Et Analyse 48 (189-192):279-300.
    An overcomplete logic is a logic that ‘ceases to make the difference’: According to such a logic, all inferences hold independently of the nature of the statements involved. A negation-inconsistent logic is a logic having at least one model that satisfies both some statement and its negation. A negation-incomplete logic has at least one model according to which neither some statement nor its negation are satisfied. Paraconsistent logics are negation-inconsistent yet non-overcomplete; paracomplete logics are negation-incomplete yet non-overcomplete. A paranormal logic (...)
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • On the theory of inconsistent formal systems.Newton C. A. da Costa - 1974 - Notre Dame Journal of Formal Logic 15 (4):497-510.
    Download  
     
    Export citation  
     
    Bookmark   177 citations  
  • Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
    Stephen Cole Kleene was one of the greatest logicians of the twentieth century and this book is the influential textbook he wrote to teach the subject to the next generation. It was first published in 1952, some twenty years after the publication of Godel's paper on the incompleteness of arithmetic, which marked, if not the beginning of modern logic. The 1930s was a time of creativity and ferment in the subject, when the notion of computable moved from the realm of (...)
    Download  
     
    Export citation  
     
    Bookmark   547 citations  
  • The mathematics of metamathematics.Helena Rasiowa - 1963 - Warszawa,: Państwowe Wydawn. Naukowe. Edited by Roman Sikorski.
    Download  
     
    Export citation  
     
    Bookmark   194 citations  
  • (2 other versions)Introduction to Metamathematics.Ann Singleterry Ferebee - 1968 - Journal of Symbolic Logic 33 (2):290-291.
    Download  
     
    Export citation  
     
    Bookmark   170 citations  
  • A propositional calculus for inconsistent deductive systems.Stanisław Jaśkowski - 1999 - Logic and Logical Philosophy 7:35.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • On the discussive conjunction in the propositional calculus for inconsistent deductive systems.Stanisław Jaśkowski - 1999 - Logic and Logical Philosophy 7:57.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Limits for Paraconsistent Calculi.Walter A. Carnielli & João Marcos - 1999 - Notre Dame Journal of Formal Logic 40 (3):375-390.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • (2 other versions)The Mathematics of Metamathematics.Donald Monk - 1963 - Journal of Symbolic Logic 32 (2):274-275.
    Download  
     
    Export citation  
     
    Bookmark   96 citations  
  • Introduction: Paraconsistent logics.Graham Priest & Richard Routley - 1984 - Studia Logica 43 (1-2):3 - 16.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Discussive sentential calculus of Jaśkowski.Jerzy Kotas - 1975 - Studia Logica 34 (2):149-168.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Paraconsistency and the $\rm C$-systems of da Costa.Igor Urbas - 1989 - Notre Dame Journal of Formal Logic 30 (4):583-597.
    Download  
     
    Export citation  
     
    Bookmark   10 citations