Limit computable integer parts

DOI10.1007/S00153-011-0241-ZzbMATH Open1247.03060OpenAlexW1970893988MaRDI QIDQ647341FDOQ647341

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

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

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)

Cites Work

• Computable structures and the hyperarithmetical hierarchy
• Ordered exponential fields
• Title not available (Why is that?)
• Real closed fields and models of Peano arithmetic
• Title not available (Why is that?)
• Every real closed field has an integer part
• A recursive nonstandard model of normal open induction
• Some weak fragments of HA and certain closure properties

Cited In (5)

• Erratum to: ``Limit computable integer parts
• Title not available (Why is that?)
• Real closed fields and models of Peano arithmetic
• Structures associated with real closed fields and the axiom of choice
• Complexity of structures associated with real closed fields

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)