Definability of types, and pairs of o-minimal structures

Journal of Symbolic Logic 59 (4):1400-1409 (1994)
  Copy   BIBTEX

Abstract

Let T be a complete O-minimal theory in a language L. We first give an elementary proof of the result (due to Marker and Steinhorn) that all types over Dedekind complete models of T are definable. Let L * be L together with a unary predicate P. Let T * be the L * -theory of all pairs (N, M), where M is a Dedekind complete model of T and N is an |M| + -saturated elementary extension of N (and M is the interpretation of P). Using the definability of types result, we show that T * is complete and we give a simple set of axioms for T * . We also show that for every L * -formula φ(x) there is an L-formula ψ(x) such that $T^\ast \models (\forall \mathbf{x})(P(\mathbf{x}) \rightarrow (\phi(\mathbf{x}) \mapsto \psi (\mathbf{x}))$ . This yields the following result: Let M be a Dedekind complete model of T. Let φ(x, y) be an L-formula where l(y) = k. Let $\mathbf{X} = \{X \subset M^k$ : for some a in an elementary extension N of M, X = φ (a,y N ∩ M k }. Then there is a formula ψ(y, z) of L such that X = {ψ (y, b) M : b in M}

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,667

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A note on standard systems and ultrafilters.Fredrik Engström - 2008 - Journal of Symbolic Logic 73 (3):824-830.
The geometry of weakly minimal types.Steven Buechler - 1985 - Journal of Symbolic Logic 50 (4):1044-1053.
Model theory of the regularity and reflection schemes.Ali Enayat & Shahram Mohsenipour - 2008 - Archive for Mathematical Logic 47 (5):447-464.
Pseudoprojective strongly minimal sets are locally projective.Steven Buechler - 1991 - Journal of Symbolic Logic 56 (4):1184-1194.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
On dedekind complete o-minimal structures.Anand Pillay & Charles Steinhorn - 1987 - Journal of Symbolic Logic 52 (1):156-164.

Analytics

Added to PP
2009-01-28

Downloads
85 (#264,648)

6 months
14 (#232,474)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Generic pairs of SU-rank 1 structures.Evgueni Vassiliev - 2003 - Annals of Pure and Applied Logic 120 (1-3):103-149.
A note on μ-stabilizers in ACVF.Jinhe Ye - 2023 - Annals of Pure and Applied Logic 174 (3):103210.
The Marker–Steinhorn Theorem.Pablo Andújar Guerrero - 2025 - Notre Dame Journal of Formal Logic 66 (1):1-10.

Add more citations

References found in this work

No references found.

Add more references