THE Σ1-DEFINABLE UNIVERSAL FINITE SEQUENCE

被引:2
|
作者
Hamkins, Joel David [1 ,2 ]
Williams, Kameryn J. [3 ]
机构
[1] Univ Oxford, Fac Philosophy, Radcliffe Observ Quarter 555,Woodstock Rd, Oxford OX2 6GG, England
[2] Univ Coll, High St, Oxford OX1 4BH, England
[3] Univ Hawaii Manoa, Dept Math, 2565 Mccarthy Mall Keller 401A, Honolulu, HI 96822 USA
关键词
potentialism; end-extensions of models of set theory; maximality principles;
D O I
10.1017/jsl.2020.59
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We introduce the Sigma(1)-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is Sigma(1)-definable and provably finite; (ii) the sequence is empty in transitive models; and (iii) if M is a countable model of set theory in which the sequence is s and t is any finite extension of s in this model, then there is an end-extension ofM to a model in which the sequence is t. Our proof method grows out of a new infinitary-logic-free proof of the Barwise extension theorem, by which any countable model of set theory is end-extended to a model of V = L or indeed any theory true in a suitable submodel of the original model. The main theorem settles the modal logic of end-extensional potentialism, showing that the potentialist validities of the models of set theory under end-extensions are exactly the assertions of S4. Finally, we introduce the end-extensional maximality principle, which asserts that every possibly necessary sentence is already true, and show that every countable model extends to a model satisfying it.
引用
收藏
页码:783 / 801
页数:19
相关论文
共 50 条
  • [31] A classification of definable forcings on omega(1)
    Zapletal, J
    FUNDAMENTA MATHEMATICAE, 1997, 153 (02) : 141 - 144
  • [32] Universal Lemmatizer: A sequence-to-sequence model for lemmatizing Universal Dependencies treebanks
    Kanerva, Jenna
    Ginter, Filip
    Salakoski, Tapio
    NATURAL LANGUAGE ENGINEERING, 2021, 27 (05) : 545 - 574
  • [33] Σ1(κ)-DEFINABLE SUBSETS OF H(κ plus )
    Luecke, Philipp
    Schindler, Ralf
    Schlicht, Philipp
    JOURNAL OF SYMBOLIC LOGIC, 2017, 82 (03) : 1106 - 1131
  • [34] On the consistency of the Definable Tree Property on ℵ1
    Leshem, A
    JOURNAL OF SYMBOLIC LOGIC, 2000, 65 (03) : 1204 - 1214
  • [35] Finite paths are universal
    Hubicka, J
    Nesetril, J
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2004, 21 (03): : 181 - 200
  • [36] Finite Paths are Universal
    J. Hubička
    J. Nešetřil
    Order, 2004, 21 : 181 - 200
  • [37] Finite Paths are Universal
    Jan Hubička
    Jaroslav Nešetřil
    Order, 2005, 22 : 21 - 40
  • [38] Finite paths are universal
    Hubicka, J
    Nesetril, J
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2005, 22 (01): : 21 - 40
  • [39] UNIVERSAL FINITE AUTOMATA
    BOGOMOLOV, AM
    SYTNIK, AA
    DOKLADY AKADEMII NAUK SSSR, 1987, 294 (03): : 525 - 528
  • [40] EFFECTIVE COUNTING OF THE POINTS OF DEFINABLE SETS OVER FINITE-FIELDS
    FRIED, MD
    HARAN, D
    JARDEN, M
    ISRAEL JOURNAL OF MATHEMATICS, 1994, 85 (1-3) : 103 - 133