Paraconsistent Logics: 3 Trends & Another Approach?

  • Thread starter Thread starter nomadreid
  • Start date Start date
nomadreid
Gold Member
Messages
1,748
Reaction score
243
From a survey of paraconsistent logics, it appears to me that there are three main trends:
(1) Weaken implication and do away with the Axiom of Foundation in ZFC, so that the more annoying paradoxes cannot be derived. (e.g., Weber)
(2) Do away with type theory, relabeling classes as "inconsistent sets", in such a way as to allow those contradictions which previously were eliminated by type theory (e.g., Carnielli),
(3) Introduce a multi-valued logic whereby the paradoxical statements receive a new truth value (e.g., Belnap)

However, one of the reasons for interest in paraconsistent logic is not only to solve the paradoxes (which are important for Foundations but of little interest to other practicing mathematicians), but also to be able to handle information taken from humans which, for one reason or the other, ends up being contradictory. This latter style of contradiction has nothing to do with the infamous paradoxes. So it would seem that another approach is necessary than the three outlined above. Are there any? If so, I would appreciate a link that is freely accessible on the Internet. Thanks.
 
Physics news on Phys.org
Well, paraconsistent logic is primarily intended as a way of handling contradictory information. The motivation for Belnap's four-valued logic is precisely that, rather than anything having to do with paradoxes. Afaik the one major paraconsistent approach that does intend to deal with the Liar paradox and such is Priest's dialetheism, embodied in the Logic of Paradox and its relatives. Other than that, paraconsistent logic has been pursued imo most prominently by Belnap, Dunn, da Costa and Béziau, so look into those.

Also, doing away with the Axiom of Foundations in ZFC doesn't seem to have anything to do with paraconsistent logic (as far as we can tell, no "paradoxes" can be derived in ZFC, so I'm not sure what you mean by "doing away with the Axiom of Foundation in ZFC, so that the more annoying paradoxes cannot be derived"), while "weakening implication" is (in the sense that A & ~A -> B is not a theorem) common to all paraconsistent logics.
 
Last edited:
Thanks, Preno, I will look into Dunn, da Costa and Béziau, as well as more into Belnap.
My grammar was a little off when I wrote (2), in that I meant that the weakening of implication disallowed the derivation of the paradoxes, and the elimination of the Axiom of Foundation in Weber permits sets which are members of themselves without subsequent explosion.
Curious: in the email notifying me of your reply, it was mentioned that you had never heard of Weber and Carnielli, but in the Forum this was taken away, indicating that you had edited that out by the time I got to it. My guess is that you looked them up in the meantime, right?
 
nomadreid said:
Curious: in the email notifying me of your reply, it was mentioned that you had never heard of Weber and Carnielli, but in the Forum this was taken away, indicating that you had edited that out by the time I got to it. My guess is that you looked them up in the meantime, right?
Yes. Carnielli seems to be a student of Newton da Costa, while Weber seems to belong to the Australasian school like Graham Priest. I removed that because my personal ignorance need not reflect on the actual state of affairs in the field of paraconsistent logic. (However, speaking as an outsider, it is true that Weber and Carnielli to me are not the most visible members of the paraconsistent community.)
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top