Scott Ranks of Classifications of the Admissibility Equivalence Relation
Abstract
Let L be a recursive language. Let S(L) be the set of L-structures with domain ω. Let : ω 2 → S(L) be a 11 function with the property that for all x,y ∈ ω 2, ω1x = ω1y if and only if (x) ≈L (y). Then there is some x ∈ ω 2 so that SR((x)) = ω1x + 1.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.