d-computable categoricity for algebraic fields

DOI10.2178/jsl/1254748694zbMath1202.03044MaRDI QIDQ3655259

Russell G. Miller

Publication date: 7 January 2010

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1254748694

zbMATH Keywords

computable structure; computable categoricity; computable field; computable algebraic field

Mathematics Subject Classification ID

03C57: Computable structure theory, computable model theory

03D45: Theory of numerations, effectively presented structures

Related Items

DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION, A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS, Degrees of categoricity of trees and the isomorphism problem, Pairs of theories satisfying a Mordell–Lang condition, Computable categoricity for algebraic fields with splitting algorithms, Categoricity properties for computable algebraic fields, DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS, On generalized Cesaro means of integral order, Computable dimension for ordered fields, Computable fields and the bounded Turing reduction, Categoricity spectra for polymodal algebras, On categoricity spectra for locally finite graphs, Degrees of autostability for prime Boolean algebras, Classifications of computable structures, Computability-theoretic categoricity and Scott families, Effective algebraicity, Degrees of categoricity of rigid structures, Categoricity spectra of computable structures, Non-coding enumeration operators, Computable procedures for fields, On decidable categoricity and almost prime models, Strong degrees of categoricity and weak density, Turing degrees of complete formulas of almost prime models, Degrees of bi-embeddable categoricity of equivalence structures, Computability-theoretic properties of injection structures, Degrees of categoricity vs. strong degrees of categoricity, Degrees of autostability for linear orders and linearly ordered abelian groups, Effective categoricity for distributive lattices and Heyting algebras, Degrees of categoricity of computable structures, An introduction to computable model theory on groups and fields, Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey, Some Questions in Computable Mathematics, A Note on Effective Categoricity for Linear Orderings, Is it harder to factor a polynomial or to find a root?, Prime Model with No Degree of Autostability Relative to Strong Constructivizations, Spectra of Algebraic Fields and Subfields

Cites Work

• Degrees of orderings not isomorphic to recursive linear orderings
• Generic copies of countable structures
• Degree spectra and computable dimensions in algebraic structures
• The computable dimension of ordered abelian groups
• Effective procedures in field theory
• The computable dimension of trees of infinite height
• Computable categoricity of trees of finite height
• Effective content of field theory
• Theorie Der Numerierungen III
• The Computable Dimension of I-Trees of Infinite Height
• Class groups of integral group rings