Non-absoluteness of Hjorth's Cardinal Characterization
Philipp L\"ucke, Ioannis Souldatos

TL;DR
This paper proves that Hjorth's characterization of certain infinite models is independent of ZFC axioms, showing the property varies across different set-theoretic assumptions like BPFA and CH.
Contribution
It establishes the independence of Hjorth's cardinal characterization from ZFC by introducing a diagonalization principle and analyzing its behavior under different set-theoretic axioms.
Findings
Hjorth's solution differs in models of BPFA versus CH.
The diagonalization principle can be forced over CH models.
Large cardinals are not necessary for the independence result.
Abstract
In [5], Hjorth proved that for every countable ordinal , there exists a complete -sentence that has models of all cardinalities less than or equal to , but no models of cardinality . Unfortunately, his solution does not yield a single -sentence , but a set of -sentences, one of which is guaranteed to work. It was conjectured in [9] that it is independent of the axioms of ZFC which of these sentences has the desired property. In the present paper, we prove that this conjecture is true. More specifically, we isolate a diagonalization principle for functions from to which is a consequence of the Bounded Proper Forcing Axiom (BPFA) and then we use this principle to prove that Hjorth's solution to…
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
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Philosophy and Theoretical Science
