Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T17:26:18.330Z Has data issue: false hasContentIssue false

Extensions of ordered theories by generic predicates

Published online by Cambridge University Press:  12 March 2014

Alfred Dolich*
Affiliation:
Department of Mathematics and Computer Science, Chicago State University, Chicago, IL 60628, USA
Chris Miller
Affiliation:
Department of Mathematics, The ohio State University, Columbus OH 43210, USA, E-mail:miller@math.osu.edu
Charles Steinhorn
Affiliation:
Department of Mathematics, Vassar College, Poughkeepsie NY 12604, USA, E-mail:steinhorn@vassar.edu
*
Department of Mathematics and Computer Science, Kingsborough Community College, 2001 Oriental Boulevard, Brooklyn NY 11235, USA, E-mail:alfredo.dolich@kbcc.cuny.edu

Extract

Given a theory T extending that of dense linear orders without endpoints (DLO), in a language ℒ ⊇ {<}, we are interested in extensions T′ of T in languages extending ℒ by unary relation symbols that are each interpreted in models of T′ as sets that are both dense and codense in the underlying sets of the models.

There is a canonically “wild” example, namely T = Th(〈ℝ, <, +, ·〉) and T′ = Th(〈ℝ, <, +, · ℚ 〉). Recall that T is o-minimal, and so every open set definable in any model of T has only finitely many definably connected components. But it is well known that 〈ℝ, <, +, · ℚ 〉 defines every real Borel set, in particular, every open subset of any finite cartesian power of ℝ and every subset of any finite cartesian power of ℚ. To put this another way, the definable open sets in models of T are essentially as simple as possible, while T′ has a model where the definable open sets are as complicated as possible, as is the structure induced on the new predicate.

In contrast to the preceding example, if ℝalg is the set of real algebraic numbers and T′ Th(〈ℝ, <, +, ·, 〈alg〉), then no model of T′ defines any open set (of any arity) that is not definable in the underlying model of T.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable