d-computable categoricity for algebraic fields

DOI10.2178/jsl/1254748694zbMath1202.03044OpenAlexW2150583267MaRDI 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 structurecomputable categoricitycomputable fieldcomputable algebraic field

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (36)

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

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

This page was built for publication: d-computable categoricity for algebraic fields