Real closures of models of weak arithmetic

DOI10.1007/s00153-012-0311-xzbMath1263.03056WikidataQ115920228 ScholiaQ115920228MaRDI QIDQ1935370

Emil Jeřábek, Leszek Aleksander Kołodziejczyk

Publication date: 15 February 2013

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

Full work available at URL: https://doi.org/10.1007/s00153-012-0311-x

zbMATH Keywords

real-closed field; bounded arithmetic; models of arithmetic; recursive saturation; Tennenbaum's theorem

Mathematics Subject Classification ID

03F30: First-order arithmetic and fragments

03H15: Nonstandard models of arithmetic

03C62: Models of arithmetic and set theory

Related Items

UNCOUNTABLE REAL CLOSED FIELDS WITH PA INTEGER PARTS, Models of VTC0$\mathsf {VTC^0}$ as exponential integer parts, On the value group of a model of Peano arithmetic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strength of sharply bounded induction requires MSP
• Bootstrapping. I
• Building discretely ordered Bezout domains and GCD domains
• Primes and their residue rings in models of open induction
• Corrigendum to: “Real closed fields and models of arithmetic”
• A recursive nonstandard model of normal open induction
• Every real closed field has an integer part
• On the complexity of models of arithmetic
• Bounded existential induction
• An introduction to recursively saturated and resplendent models
• Model Theory
• Real closed fields and models of Peano arithmetic
• UNCOUNTABLE REAL CLOSED FIELDS WITH PA INTEGER PARTS
• Algorithms in real algebraic geometry