Relative Definability of $n$-Generics
Wei Wang

TL;DR
This paper investigates the definability properties of n-generic sets, showing they are properly Σ⁰ₙ in some G-recursive set and confirming conjectures about their generalized lowness.
Contribution
It proves that every n-generic set is properly Σ⁰ₙ in some G-recursive set and confirms two conjectures of Jockusch regarding generalized lowness.
Findings
Every n-generic set G is properly Σ⁰ₙ in some G-recursive X.
For n > 1, there exists a G-recursive X that is generalized low_n but not generalized low_{n-1}.
Confirmed two conjectures of Jockusch about n-generic sets.
Abstract
A set is -generic for a positive integer if and only if every formula of is decided by a finite initial segment of in the sense of Cohen forcing. It is shown here that every -generic set is properly in some -recursive . As a corollary, we also prove that for every and every -generic set there exists a -recursive which is generalized but not generalized . Thus we confirm two conjectures of Jockusch.
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 · Advanced Topology and Set Theory · semigroups and automata theory
