Tameness for set theory $I$
Matteo Viale

TL;DR
This paper demonstrates that, under large cardinal assumptions, set theory can be viewed as a tame first-order theory when formalized with natural predicates, linking generic absoluteness to model companionship.
Contribution
It develops a framework connecting generic absoluteness results to model companionship, showing equivalences involving forcibility, consistency, and realization in model companions.
Findings
Set theory is tame under large cardinal assumptions.
Equivalence between forcibility, consistency, and realization in model companions.
Framework applies to second and third order arithmetic.
Abstract
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic definable concepts of second and third order arithmetic, and appealing to the model-theoretic notions of model completeness and model companionship. Specifically we develop a general framework linking generic absoluteness results to model companionship and show that (with the required care in details) a -property formalized in an appropriate language for second or third order number theory is forcible from some large cardinals if and only if it is consistent with the universal fragment of if and only if it is realized in the model companion of . The paper is accessible to any person who has a fair acquaintance…
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
