LEVEL THEORY, PART 3: A BOOLEAN ALGEBRA OF SETS ARRANGED IN WELL-ORDERED LEVELS

被引:1
作者
Button, T. I. M. [1 ]
机构
[1] UCL, Dept Philosophy, Gower St, London WC1E 6BT, England
关键词
set theory; level theory; universal set;
D O I
10.1017/bsl.2021.15
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:1 / 26
页数:26
相关论文
共 23 条
  • [1] [Anonymous], 1965, Formal systems and Recursive Functions
  • [2] [Anonymous], 1990, SETS INTRO
  • [3] Boolos G., 1971, Journal of Philosophy, V68, P215, DOI [DOI 10.2307/2025204, 10.2307/2025204]
  • [4] Boolos George, 1989, Philosophical Topics, V17, P5
  • [5] Button Tim, 2018, PHILOS MODEL THEORY
  • [6] Church A., 1974, Proceedings of the Tarski Symposium, P297
  • [7] Conway JA., 1976, NUMBERS GAMES
  • [8] Amphi-ZF: axioms for Conway games
    Cox, Michael
    Kaye, Richard
    [J]. ARCHIVE FOR MATHEMATICAL LOGIC, 2012, 51 (3-4): : 353 - 371
  • [9] Forster T., 2001, Logic, Meaning and Computation, P109
  • [10] THE ITERATIVE CONCEPTION OF SET
    Forster, Thomas
    [J]. REVIEW OF SYMBOLIC LOGIC, 2008, 1 (01) : 97 - 110