2000 character limit reached
Scott Ranks of Classifications of the Admissibility Equivalence Relation
Published 3 Dec 2017 in math.LO | (1712.00847v1)
Abstract: Let $\mathscr{L}$ be a recursive language. Let $S(\mathscr{L})$ be the set of $\mathscr{L}$-structures with domain $\omega$. Let $\Phi : {}\omega 2 \rightarrow S(\mathscr{L})$ be a $\Delta_11$ function with the property that for all $x,y \in {}\omega 2$, $\omega_1x = \omega_1y$ if and only if $\Phi(x) \approx_{\mathscr{L}} \Phi(y)$. Then there is some $x \in {}\omega 2$ so that $\mathrm{SR}(\Phi(x)) = \omega_1x + 1$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.