Level Theory, Part 3: A Boolean Algebra of Sets Arranged in Well-Ordered Levels

Bulletin of Symbolic Logic 28 (1):1-26 (2022)
  Copy   BIBTEX

Abstract

On a very natural conception of sets, every set has an absolute complement. The ordinary cumulative hierarchy dismisses this idea outright. But we can rectify this, whilst retaining classical logic. Indeed, we can develop a boolean algebra of sets arranged in well-ordered levels. I show this by presenting Boolean Level Theory, which fuses ordinary Level Theory (from Part 1) with ideas due to Thomas Forster, Alonzo Church, and Urs Oswald. BLT neatly implement Conway’s games and surreal numbers; and a natural extension of BLT is definitionally equivalent with ZF.

Other Versions

No versions found

Similar books and articles

Elementary embedding between countable Boolean algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
Definable sets in Boolean ordered o-minimal structures. II.Roman Wencel - 2003 - Journal of Symbolic Logic 68 (1):35-51.
A Boolean model of ultrafilters.Thierry Coquand - 1999 - Annals of Pure and Applied Logic 99 (1-3):231-239.
Fine hierarchies and Boolean terms.V. L. Selivanov - 1995 - Journal of Symbolic Logic 60 (1):289-317.
Minimum‐sized Infinite Partitions of Boolean Algebras.J. Monk - 1996 - Mathematical Logic Quarterly 42 (1):537-550.

Analytics

Added to PP
2021-04-29

Downloads
1,037 (#52,223)

6 months
244 (#35,211)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Tim Button
University College London

References found in this work

Modal Logic as Metaphysics.Timothy Williamson - 2013 - Oxford, England: Oxford University Press.
Thin Objects: An Abstractionist Account.Øystein Linnebo - 2018 - Oxford: Oxford University Press.
Philosophy and Model Theory.Tim Button & Sean Walsh - 2018 - Oxford, UK: Oxford University Press. Edited by Sean Walsh & Wilfrid Hodges.

View all 35 references / Add more references