Pages that link to "Item:Q3399191"

The following pages link to Intrinsic bounds on complexity and definability at limit levels (Q3399191):

Displaying 14 items.

• Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism (Q384395) (← links)
• The complexity of computable categoricity (Q471691) (← links)
• Preserving categoricity and complexity of relations (Q887644) (← links)
• Effective categoricity of abelian \(p\)-groups (Q1023056) (← links)
• Computability-theoretic categoricity and Scott families (Q1740457) (← links)
• Categoricity spectra of computable structures (Q2036466) (← links)
• Degrees of categoricity for superatomic Boolean algebras (Q2434601) (← links)
• Degrees of autostability relative to strong constructivizations (Q2510761) (← links)
• A Note on Effective Categoricity for Linear Orderings (Q2988812) (← links)
• Notes on the Jump of a Structure (Q3576069) (← links)
• Degrees of bi-embeddable categoricity (Q4995600) (← links)
• 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms (Q5741344) (← links)
• Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension (Q5965131) (← links)
• Categoricity and complexity of relations over algebraic structures (Q5965135) (← links)