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.

Author's Profile

Tim Button
University College London

Analytics

Added to PP
2021-04-29

Downloads
234 (#62,311)

6 months
105 (#35,174)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?