A strictly finitary non-triviality proof for a paraconsistent system of set theory deductively equivalent to classical ZFC minus foundation

Archive for Mathematical Logic 39 (8):581-598 (2000)
  Copy   BIBTEX

Abstract

The paraconsistent system CPQ-ZFC/F is defined. It is shown using strong non-finitary methods that the theorems of CPQ-ZFC/F are exactly the theorems of classical ZFC minus foundation. The proof presented in the paper uses the assumption that a strongly inaccessible cardinal exists. It is then shown using strictly finitary methods that CPQ-ZFC/F is non-trivial. CPQ-ZFC/F thus provides a formulation of set theory that has the same deductive power as the corresponding classical system but is more reliable in that non-triviality is provable by strictly finitary methods. This result does not contradict Gödel's incompleteness theorem because the proof of the deductive equivalence of the paraconsistent and classical systemss use non-finitary methods

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Whither relevant arithmetic?Harvey Friedman & Robert K. Meyer - 1992 - Journal of Symbolic Logic 57 (3):824-831.
The gödel paradox and Wittgenstein's reasons.Francesco Berto - 2009 - Philosophia Mathematica 17 (2):208-219.
On the role of implication in formal logic.Jonathan P. Seldin - 2000 - Journal of Symbolic Logic 65 (3):1076-1114.
The inadequacy of a proposed paraconsistent set theory.Frode Bjørdal - 2011 - Review of Symbolic Logic 4 (1):106-108.
Minimally inconsistent LP.Graham Priest - 1991 - Studia Logica 50 (2):321 - 331.
Paraconsistent logic and model theory.Elias H. Alves - 1984 - Studia Logica 43 (1-2):17 - 32.
Level Compactness.Gillman Payette & Blaine D'Entremont - 2006 - Notre Dame Journal of Formal Logic 47 (4):545-555.

Analytics

Added to PP
2013-11-23

Downloads
16 (#911,480)

6 months
4 (#798,384)

Historical graph of downloads
How can I increase my downloads?

References found in this work

[Omnibus Review].Thomas Jech - 1992 - Journal of Symbolic Logic 57 (1):261-262.
Completeness of relevant quantification theories.Robert K. Meyer, J. Michael Dunn & Hugues Leblanc - 1974 - Notre Dame Journal of Formal Logic 15 (1):97-121.

Add more references