A note on computable real fields
From MaRDI portal
Cited in
(13)- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
- Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets
- Concrete models of computation for topological algebras
- Degree spectra of real closed fields
- Computable dimension for ordered fields
- The Diophantine problem in the classical matrix groups
- Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable
- Primitive recursive ordered fields and some applications
- Punctually presented structures I: Closure theorems
- Order positive fields. I
- Computably and punctually universal spaces
- Domain representability of metric spaces
- Primitive recursive ordered fields and some applications
This page was built for publication: A note on computable real fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4041564)