Abstract
The purpose of this paper is to highlight and discuss two ideas that play in to the axiomatic development of a paraconsistent naive set theory. We will focus on aspects of the theory that can be read right off the axioms, concerning intensional identity and unrestricted set existence. Both relate to inconsistency. To begin I lay out a relevant background logic, placing a strong emphasis on the restrictions such a logic must have in order to support an inconsistent set theory. The sections that follow proceed on the understanding that, while highly inconsistent, a good deal of control is being exerted on the theory through the weakened logic. The two features of a fully naive theory, identity and self-reference, dovetail throughout.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Following a distinction I first saw in Libert (2005), Axiom 17.1 is called abstraction, while the formulation in Theorem 17.3 below is called comprehension. There is a syntactic difference between abstraction and comprehension, and in weak paraconsistent logics the principles are not equally user-friendly, because the quantifier ∃is sometimes tricky to eliminate. Nevertheless, both formulations capture a core intuition and in informal discussion the names are used interchangeably, without intending to mark an important difference.
- 2.
The first step in securing a set theoretic account of functions is defined ordered pairs and show them to behave according to the law \(\langle a,b\rangle =\langle c,d\rangle \dashv \vdash a = c,b = d.\) We will be assuming throughout that some approximation of standard mathematical functions is available.
- 3.
Without full comprehension, one can prove that the set of all sets is Dedekind infinite by producing an injection into itself, say by a map x↦{x}, but, again, functions and cardinality arguments are mostly beyond our scope here.
- 4.
- 5.
Compare this to Petersen’s characterization of the natural numbers, (Petersen, 2000, p. 386).
- 6.
Conrad Asmus pointed this out.
References
Arruda, A.I., and D. Batens. 1982. Russell’s set and the universal set in paraconsistent set theory. Logique et Analyse 25: 121–133.
Austin, D.F. (ed.). 1988. Philosophical analysis. Dordrecht: Holland
Barwise, J., and L. Moss. 1996. Vicious circles. Stanford: csli Publications.
Batens, D., C. Mortensen, G. Priest, and J.-P. van Bendegem. eds. 2000. Frontiers of paraconsistent logic. Philadelphia: Research Studies Press.
Beall, J.C., R.T. Brady, A.P. Hazen, G. Priest, and G. Restall. 2006. Relevant restricted quantification. Journal of Philosophical Logic 35: 587–598.
Brady, R.T. 1989. The non-triviality of dialectical set theory. In Paraconsistent logic: Essays on the inconsistent, ed. G. Priest, R. Routley, and J. Norman, 437–470. Munich: Philosophia Verlag.
Brady, R.T. 2006. Universal logic. Stanford: CSLI.
Brady, R.T., and R. Routley. 1989. The non-triviality of extensional dialectical set theory. In Paraconsistent logic: Essays on the inconsistent, ed. G. Priest, R. Routley, and J. Norman, 415–436. Munich: Philosophia Verlag.
Curry, H.B. 1942. The inconsistency of certain formal logics. Journal of Symbolic Logic 7: 115–117.
da Costa, N.C.A. 1974. On the theory of inconsistent formal systems. Notre Dame Journal of Formal Logic 15: 497–510.
da Costa, N.C.A. 2000. Paraconsistent mathematics. In Frontiers of paraconsistent logic, ed. D. Batens, C. Mortensen, G. Priest, and J.-P. van Bendegem, 165–180. Philadelphia: Research Studies Press.
Dunn, J.M. 1988. The impossibility of certain higher-order non-classical logics with extensionality. In Philosophical analysis, ed. D.F. Austin, 261–280. Dordrecht: Holland
Lewis, C.I., and C.H. Langford. 1959. Symbolic logic. New York: Dover.
Libert, T. 2005. Models for paraconsistent set theory. Journal of Applied Logic 3: 15–41.
Mares, E. 2004. Relevant logic. Cambridge: Cambridge University Press.
Meyer, R.K., R. Routley, and J.M. Dunn. 1978. Curry’s paradox. Analysis 39: 124–128.
Petersen, U. 2000. Logic without contraction as based on inclusion and unrestricted abstraction. Studia Logica 64: 365–403.
Priest, G. 2000. Inconsistent models of arithmetic, ii: The general case. Journal of Symbolic Logic 65: 1519–29.
Priest, G., R. Routley, and J. Norman (eds.). 1989. Paraconsistent logic: Essays on the inconsistent. Munich: Philosophia Verlag.
Restall, G. 1994. On logics without contraction. Ph.D. thesis. The University of Queensland.
Routley, R. 1977. Ultralogic as universal? Relevance Logic Newsletter2: 51–89. Reprinted in Routley (1980).
Routley, R. 1980. Exploring Meinong’s jungle and beyond. Departmental Monograph, Philosophy Department, RSSS, Australian National University, vol. 3. Canberra: RSSS, Australian National University, Canberra.
Routley, R., and R.K. Meyer. 1976. Dialectical logic, classical logic and the consistency of the world. Studies in Soviet Thought 16: 1–25.
Slaney, J.K. 1989. Rwx is not curry-paraconsistent. In Paraconsistent logic: Essays on the inconsistent, ed. G. Priest, R. Routley, and J. Norman, 472–480. Munich: Philosophia Verlag.
Weber, Z. 2010a. Extensionality and restriction in naive set theory. Studia Logica 94(1): 87–104.
Weber, Z. 2010b. Transfinite numbers in paraconsistent set theory. Review of Symbolic Logic 3(1): 71–92.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht.
About this chapter
Cite this chapter
Weber, Z. (2013). Notes on Inconsistent Set Theory. In: Tanaka, K., Berto, F., Mares, E., Paoli, F. (eds) Paraconsistency: Logic and Applications. Logic, Epistemology, and the Unity of Science, vol 26. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-4438-7_17
Download citation
DOI: https://doi.org/10.1007/978-94-007-4438-7_17
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-4437-0
Online ISBN: 978-94-007-4438-7
eBook Packages: Humanities, Social Sciences and LawPhilosophy and Religion (R0)