The Sigma_1-definable universal finite sequence
Joel David Hamkins, Kameryn J. Williams

TL;DR
This paper introduces a $oldsymbol{ extSigma_1}$-definable universal finite sequence in set theory, demonstrating its properties and implications for end-extension potentialism and modal logic, with new proof techniques and principles.
Contribution
It defines a $oldsymbol{ extSigma_1}$-definable universal finite sequence and proves its properties, advancing understanding of end-extension potentialism and modal logic in set theory.
Findings
The sequence is $oldsymbol{ extSigma_1}$-definable and provably finite.
The sequence is empty in transitive models.
Models can be extended to satisfy the end-extensional maximality principle.
Abstract
We introduce the -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 -definable and provably finite; (ii) the sequence is empty in transitive models; and (iii) if is a countable model of set theory in which the sequence is and is any finite extension of in this model, then there is an end-extension of to a model in which the sequence is . 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 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Benford’s Law and Fraud Detection
