Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Paraconsistent and Paracomplete Zermelo-Fraenkel Set Theory (2210.00057v2)

Published 30 Sep 2022 in math.LO

Abstract: We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from previous research in paraconsistent set theory, which has almost exclusively been motivated by a desire to avoid Russell's paradox and fulfil naive comprehension. Instead, we prioritise setting up a system with a clear ontology of non-classical sets, which can be used to reason informally about incomplete and inconsistent phenomena, and is sufficiently similar to ZFC to enable the development of interesting mathematics. We propose an axiomatic system BZFC, obtained by analysing the ZFC-axioms and translating them to a four-valued setting in a careful manner, avoiding many of the obstacles encountered by other attempted formalizations. We introduce the anti-classicality axiom postulating the existence of non-classical sets, and prove a surprising results stating that the existence of a single non-classical set is sufficient to produce any other type of non-classical set. Our theory is naturally bi-interpretable with ZFC, and provides a philosophically satisfying view in which non-classical sets can be seen as a natural extension of classical ones, in a similar way to the non-well-founded sets of Peter Aczel. Finally, we provide an interesting application concerning Tarski semantics, showing that the classical definition of the satisfaction relation yields a logic precisely reflecting the non-classicality in the meta-theory.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. Peter Aczel. Non-well-founded sets, volume 14 of CSLI Lecture Notes. Stanford University, Center for the Study of Language and Information, Stanford, CA, 1988. With a foreword by Jon Barwise [K. Jon Barwise].
  2. Constructible falsity and inexact predicates. The Journal of Symbolic Logic, 49(1):231–233, 1984.
  3. F. G. Asenjo. A calculus of antinomies. Notre Dame J. Formal Logic, 7:103–105, 1966.
  4. Arnon Avron. Natural 3333-valued logics—characterization and proof theory. J. Symbolic Logic, 56(1):276–294, 1991.
  5. Andrew Bacon. Non-classical metatheory for non-classical logics. J. Philos. Logic, 42(2):335–355, 2013.
  6. Embedding and interpolation for some paralogics. The propositional case. Rep. Math. Logic, (33):29–44, 1999.
  7. Nuel D. Belnap. How a computer should think. In New essays on Belnap-Dunn logic, volume 418 of Synth. Libr., pages 35–53. Springer, Cham, [2019] ©2019.
  8. Nuel D. Belnap. A useful four-valued logic. In New essays on Belnap-Dunn logic, volume 418 of Synth. Libr., pages 55–76. Springer, Cham, [2019] ©2019.
  9. Paraconsistent set theory by predicating on consistency. J. Logic Comput., 26(1):97–116, 2016.
  10. Logics of Formal Inconsistency, pages 1–93. Springer Netherlands, Dordrecht, 2007.
  11. J. Michael Dunn. Intuitive semantics for first-degree entailments and ‘coupled trees’. Philos. Studies, 29(3):149–168, 1976.
  12. P. T. Geach. On Insolubilia. Analysis, 15(3):71–72, 01 1955.
  13. K3, L3, LP, RM3, A3, FDE, M: how to make many-valued logics work for you. In New essays on Belnap-Dunn logic, volume 418 of Synth. Libr., pages 155–190. Springer, Cham, [2019] ©2019.
  14. Roland Hinnion. About the coexistence of “classical sets” with “non-classical” ones: a survey. Number 11-12, pages 79–90. 2003. Flemish-Polish Workshops II–IV and varia.
  15. S. C. Kleene. On notation for ordinal numbers. Journal of Symbolic Logic, 3(4):150?155, 1938.
  16. Kenneth Kunen. Elementary embeddings and infinitary combinatorics. J. Symbolic Logic, 36:407–413, 1971.
  17. Thierry Libert. Models for a paraconsistent set theory. J. Appl. Log., 3(1):15–41, 2005.
  18. Hrafn Valtýr Oddsson. Paradefinite Zermelo-Fraenkel set theory: A theory of inconsistent and incomplete sets. Master’s thesis, Universiteit van Amsterdam, 2021. ILLC Publication MoL-2021-27.
  19. Some observations on the systems LFI1 and LFI1. In 22nd International Workshop on Database and Expert Systems Applications, pages 320–324, 2011.
  20. Robert Passmann. Should pluralists be pluralists about pluralism? Synthese, 199(5-6):12663–12682, 2021.
  21. Graham Priest. The logic of paradox. J. Philos. Logic, 8(2):219–241, 1979.
  22. Helena Rasiowa. An algebraic approach to non-classical logics. Studies in Logic and the Foundations of Mathematics, Vol. 78. North-Holland Publishing Co., Amsterdam-London; American Elsevier Publishing Co., Inc., New York, 1974.
  23. Greg Restall. A note on naive set theory in LPLP{\rm LP}roman_LP. Notre Dame J. Formal Logic, 33(3):422–432, 1992.
  24. An expansion of first-order Belnap-Dunn logic. Log. J. IGPL, 22(3):458–481, 2014.
  25. How to water a thousand flowers. on the logic of logical pluralism. Inquiry, 63:1–24, 09 2017.
  26. Stewart Shapiro. Varieties of Logic. Oxford University Press, 2014.
  27. Zach Weber. Paradoxes and Inconsistent Mathematics. Cambridge University Press, 2021.

Summary

We haven't generated a summary for this paper yet.