Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-15T21:58:33.822Z Has data issue: false hasContentIssue false

TRANSFINITE NUMBERS IN PARACONSISTENT SET THEORY

Published online by Cambridge University Press:  14 January 2010

ZACH WEBER*
Affiliation:
School of Philosophy and Historical Inquiry, University of Sydney
*
*SCHOOL OF PHILOSOPHY AND HISTORICAL INQUIRY, UNIVERSITY OF SYDNEY, NSW 2006 AUSTRALIA. E-mail:zach.weber@usyd.edu.au
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper begins an axiomatic development of naive set theory—the consequences of a full comprehension principle—in a paraconsistent logic. Results divide into two sorts. There is classical recapture, where the main theorems of ordinal and Peano arithmetic are proved, showing that naive set theory can provide a foundation for standard mathematics. Then there are major extensions, including proofs of the famous paradoxes and the axiom of choice (in the form of the well-ordering principle). At the end I indicate how later developments of cardinal numbers will lead to Cantor’s theorem, the existence of large cardinals, and a counterexample to the continuum hypothesis.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2010