# Representing Scott sets in algebraic settings

@article{Dolich2015RepresentingSS,
title={Representing Scott sets in algebraic settings},
author={Alfred Dolich and Julia F. Knight and Karen M. Lange and David Marker},
journal={Archive for Mathematical Logic},
year={2015},
volume={54},
pages={631-637}
}
• Published 21 July 2014
• Mathematics
• Archive for Mathematical Logic
We prove that for every Scott set S there are S-saturated real closed fields and S-saturated models of Presburger arithmetic.
3 Citations
On Non-standard Models of Arithmetic with Uncountable Standard Systems
In 1960s, Dana Scott gave a recursion theoretic characterization of standard systems of countable non-standard models of arithmetic, i.e., collections of sets of standard natural numbers coded in
On the value group of a model of Peano Arithmetic
• Mathematics
• 2016
Abstract We investigate IPA {\mathrm{IPA}} -real closed fields, that is, real closed fields which admit an integer part whose non-negative cone is a model of Peano arithmetic. We show that the value

## References

SHOWING 1-10 OF 12 REFERENCES
A VALUATION THEORETIC CHARACTERIZATION OF RECURSIVELY SATURATED REAL CLOSED FIELDS
• Mathematics
The Journal of Symbolic Logic
• 2015
This work gives a valuation theoretic characterization for a real closed field to be recursively saturated, for a cardinal $\kappa \ge \aleph _0$, and extends the characterization of Harnik and Ressayre for a divisible ordered abelian group to be recursive saturated.
Models of Peano arithmetic
• R. Kaye
• Mathematics
Oxford logic guides
• 1991
This chapter discusses the development of the standard model for Peano arithmetic, which combines discretely ordered rings with a collection of prime models to achieve saturation.
Real closed fields and models of Peano arithmetic
• Mathematics, Computer Science
The Journal of Symbolic Logic
• 2012
This paper shows that if a real closed ordered field R has an integer part I that is a nonstandard model of PA (or even IΣ4), then R must be recursively saturated.
Degrees of recursively saturated models
• Mathematics
• 1984
Using relativizations of results of Goncharov and Peretyat'kin on decidable homogeneous models, we prove that if M is S-saturated for some Scott set S, and F is an enumeration of S, then M has a
Models of Arithmetic and Closed Ideals
• Mathematics
J. Symb. Log.
• 1982
It is shown that information about representation of closed ideals provides new information about an old problem of MacDowell and Specker [6] and extends an old result of Scott [8] in a natural way.
Minimally saturated models
A model for a complete first order theory T in a language of finite type is minimally saturated if it is recursively saturated and elementarily embeddable in every recursively saturated model of T.
Quasi-o-minimal structures
• Mathematics
Journal of Symbolic Logic
• 2000
It is shown that a counterpart of quasi-o-minimality in stability theory is the notion of theory of U-rank 1, and a technique to investigate quasi-O-minimal ordered groups is developed.
Model theory : an introduction
This book is a modern introduction to model theory which stresses applications to algebra throughout the text. The first half of the book includes classical material on model construction techniques,
Expansions of Models and Turing Degrees
• Mathematics, Computer Science
J. Symb. Log.
• 1982