
TL;DR
This paper constructs a countable $eta$-model where definability between reals coincides with hyperarithmetical reducibility, providing insights into the structure of models in descriptive set theory.
Contribution
It proves the existence of a countable $eta$-model with a unique definability property linking reals and hyperarithmetical reducibility, advancing understanding of $eta$-models.
Findings
Existence of a countable $eta$-model with specific definability properties
Equivalence of definability and hyperarithmetical reducibility within the model
Related results and open questions in the theory of $eta$-models
Abstract
We prove that there exists a countable -model in which, for all reals and , is definable from if and only is hyperarithmetical in . We also obtain some related results and pose some related questions.
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
TopicsNumerical methods for differential equations
