A note on computable real fields

DOI10.2307/2270515zbMath0291.02031OpenAlexW2171488860MaRDI QIDQ4041564

Eugene W. Madison

Publication date: 1970

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

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

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Ordered fields (12J15) Proof theory and constructive mathematics (03F99)

Related Items (11)

The Diophantine problem in the classical matrix groups ⋮ Computable dimension for ordered fields ⋮ Primitive recursive ordered fields and some applications ⋮ Punctually presented structures I: Closure theorems ⋮ Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable ⋮ Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs ⋮ Primitive recursive ordered fields and some applications ⋮ Degree spectra of real closed fields ⋮ Domain representability of metric spaces ⋮ Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets ⋮ Concrete models of computation for topological algebras

This page was built for publication: A note on computable real fields