Categoricity properties for computable algebraic fields

DOI10.1090/S0002-9947-2014-06094-7zbMath1347.03082arXiv1111.1211OpenAlexW2963645765MaRDI QIDQ5246988

Alexandra Shlapentokh, Kenneth Kramer, Denis R. Hirschfeldt, Russell G. Miller

Publication date: 22 April 2015

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.1211

zbMATH Keywords

computable categoricityScott familycomputable algebraic fieldrelative computable categoricity

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Model theory of fields (12L12) Categoricity and completeness of theories (03C35)

Related Items (10)

Preserving categoricity and complexity of relations ⋮ Effective algebraicity ⋮ Computable torsion abelian groups ⋮ Some Questions in Computable Mathematics ⋮ Computability-theoretic categoricity and Scott families ⋮ Computable transformations of structures ⋮ Categoricity spectra of computable structures ⋮ Computable categoricity for algebraic fields with splitting algorithms ⋮ Computing on the Banach space C [ 0 , 1 ] ⋮ Non-coding enumeration operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generic copies of countable structures
• Autostability of models
• Autostability and computable families of constructivizations
• Computable isomorphisms, degree spectra of relations, and Scott families
• Effective choice for relations and reducibilities in classes of constructive and positive models
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• The computable dimension of ordered abelian groups
• Computably Categorical Fields via Fermat’s Last Theorem
• Is it harder to factor a polynomial or to find a root?
• Effective procedures in field theory
• Recursive isomorphism types of recursive Boolean algebras
• The computable dimension of trees of infinite height
• Computable categoricity of trees of finite height
• Index sets of computable structures
• d-computable categoricity for algebraic fields
• Effective content of field theory
• Recursively Categorical Linear Orderings
• Theorie Der Numerierungen III
• On the complexity of categoricity in computable structures
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• Computable categoricity for algebraic fields with splitting algorithms
• The Computable Dimension of I-Trees of Infinite Height
• Computable Algebra, General Theory and Theory of Computable Fields

This page was built for publication: Categoricity properties for computable algebraic fields