Limit computable integer parts

DOI10.1007/S00153-011-0241-ZMaRDI QIDQ647341zbMATHOpenAlexFDO

Authors Paola D'Aquino, Karen Lange, J. F. Knight

Publication date 23 November 2011

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-011-0241-z

zbMATH Keywords

real closed fieldcomputable structureinteger part\(Z\)-ring

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Model theory of ordered structures; o-minimality (03C64) Model theory of fields (12L12)

Recommendations

• Complexity of structures associated with real closed fields
• Real closed fields and models of Peano arithmetic
• scientific article; zbMATH DE number 38715
• Structures associated with real closed fields and the axiom of choice
• Real closed exponential fields

Cites work

• scientific article; zbMATH DE number 3702663 (Why is no real title available?)
• scientific article; zbMATH DE number 3214534 (Why is no real title available?)
• A recursive nonstandard model of normal open induction
• Computable structures and the hyperarithmetical hierarchy
• Every real closed field has an integer part
• Ordered exponential fields
• Real closed fields and models of Peano arithmetic
• Some weak fragments of HA and certain closure properties

Cited in

(5)

• Complexity of structures associated with real closed fields
• Real closed fields and models of Peano arithmetic
• Erratum to: ``Limit computable integer parts
• scientific article; zbMATH DE number 38715 (Why is no real title available?)
• Structures associated with real closed fields and the axiom of choice

This page was built for publication: Limit computable integer parts

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