Computable Fields and Arithmetically Definable Ordered Fields

DOI10.2307/2037328zbMath0229.02039OpenAlexW4231574697MaRDI QIDQ5636867

Eugene W. Madison, Alistair H. Lachlan

Publication date: 1970

Full work available at URL: https://doi.org/10.2307/2037328

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80)

Related Items

The Diophantine problem in the classical matrix groups ⋮ Nonconstructivizability of certain ordered fields of real numbers ⋮ Continuous theory of operator expansions of finite dimensional Hilbert spaces and decidability ⋮ Domain representability of metric spaces ⋮ An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity ⋮ Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets ⋮ Concrete models of computation for topological algebras

Cites Work

• Effective procedures in field theory
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable Algebraic Structures and Nonstandard Arithmetic
• Unnamed Item