Effective algebraicity

DOI10.1007/s00153-012-0308-5zbMath1300.03021OpenAlexW2914384462MaRDI QIDQ1935364

Rebecca M. Steiner

Publication date: 15 February 2013

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-012-0308-5

zbMATH Keywords

computabilitycomputable categoricitydegree spectraalgebraic fieldcomputable treecomputable graph

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

On categoricity spectra for locally finite graphs ⋮ Prime Model with No Degree of Autostability Relative to Strong Constructivizations ⋮ Bi‐embeddability spectra and bases of spectra ⋮ Classifications of computable structures ⋮ Effectively Existentially-Atomic Structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of categoricity of computable structures
• Turing Computability
• Spectra of structures and relations
• Spectra of Algebraic Fields and Subfields
• d-computable categoricity for algebraic fields
• Degrees coded in jumps of orderings
• Computable categoricity for algebraic fields with splitting algorithms
• Categoricity properties for computable algebraic fields
• ∏ 0 1 Classes and Degrees of Theories