Computable Fields and Arithmetically Definable Ordered Fields

DOI10.2307/2037328MaRDI QIDQ5636867zbMATH OpenOpenAlexFDO

Authors Alistair H. Lachlan, Eugene W. Madison

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)

Cites work

• Computable Algebra, General Theory and Theory of Computable Fields
• Computable Algebraic Structures and Nonstandard Arithmetic
• Effective procedures in field theory
• scientific article; zbMATH DE number 3053259 (Why is no real title available?)

Cited in

(7)

• Nonconstructivizability of certain ordered fields of real numbers
• Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets
• Concrete models of computation for topological algebras
• An algorithmic construction of quantum circuits of high descriptive complexity
• The Diophantine problem in the classical matrix groups
• Continuous theory of operator expansions of finite dimensional Hilbert spaces and decidability
• Domain representability of metric spaces

This page was built for publication: Computable Fields and Arithmetically Definable Ordered Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5636867)