Computable structures of rank omega1CK
Julia Knight, Jessica Millar
Abstract
We obtain a computable structure of Scott rank omega1CK (call this ock), and give a general coding procedure that transforms any hyperarithmetical structure A into a computable structure A' such that the rank of A is ock, ock+1, or < ock iff the same is true of A'.
Create a lesson
Related papers
Logarithmic--exponential preparation in sharply o-minimal structures
Gal Binyamini, Oded Carmon, Dmitry Novikov
Stoic Logic and Natural Term Logic
Clarence Lewis Protin
From raw Solvability Complexity Index proofs to Weihrauch degrees
Christopher Sorg
Existence of bases implies the axiom of choice, a foundation-free proof
Gabriel Fernandes, Renan Maneli Mezabarba, Vinicius de Oliveira Rodrigues
Every countable meet-continuous lattice is Scott sober
Xiaoquan Xu, Wei Ji
A minimal type of Morley rank ω in a partial differential field
Piotr Kowalski