On o-minimal expansions of Archimedean ordered groups

1995 ◽  
Vol 60 (3) ◽  
pp. 817-831 ◽  
Author(s):  
Michael C. Laskowski ◽  
Charles Steinhorn
Keyword(s):  
Nonzero Element ◽  
Real Closed Field ◽  
Elementary Embedding ◽  
Closed Field ◽  
Real Numbers ◽  
Ordered Group ◽  
Ordered Groups ◽  
Differentiability Properties ◽  
Definable Function

AbstractWe study o-minimal expansions of Archimedean totally ordered groups. We first prove that any such expansion must be elementarily embeddable via a unique (provided some nonzero element is 0-definable) elementary embedding into a unique o-minimal expansion of the additive ordered group of real numbers . We then show that a definable function in an o-minimal expansion of enjoys good differentiability properties and use this to prove that an Archimedean real closed field is definable in any nonsemilinear expansion of . Combining these results, we obtain several restrictions on possible o-minimal expansions of arbitrary Archimedean ordered groups and in particular of the rational ordered group.

Quasi-o-minimal structures

2000 ◽  
Vol 65 (3) ◽  
pp. 1115-1132 ◽  
Author(s):  
Oleg Belegradek ◽  
Ya'acov Peterzil ◽  
Frank Wagner
Keyword(s):  
Stability Theory ◽  
Real Closed Field ◽  
Closed Field ◽  
Ordered Group ◽  
Ordered Groups ◽  
Zero Multiplication ◽  
Ordered Ring ◽  
Extra Structure

AbstractA structure (M, <, …) is called quasi-o-minimal if in any structure elementarily equivalent to it the definable subsets are exactly the Boolean combinations of 0-definable subsets and intervals. We give a series of natural examples of quasi-o-minimal structures which are not o-minimal; one of them is the ordered group of integers. We develop a technique to investigate quasi-o-minimality and use it to study quasi-o-minimal ordered groups (possibly with extra structure). Main results: any quasi-o-minimal ordered group is abelian; any quasi-o-minimal ordered ring is a real closed field, or has zero multiplication; every quasi-o-minimal divisible ordered group is o-minimal; every quasi-o-minimal archimedian densely ordered group is divisible. We show that a counterpart of quasi-o-minimality in stability theory is the notion of theory of U-rank 1.

Number systems with simplicity hierarchies: a generalization of Conway's theory of surreal numbers

2001 ◽  
Vol 66 (3) ◽  
pp. 1231-1258 ◽  
Author(s):  
Philip Ehrlich
Keyword(s):  
Set Theory ◽  
Number Fields ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Numbers ◽  
Ordered Group ◽  
Von Neumann ◽  
Ordered Field ◽  
Number Systems ◽  
Ordered Fields

Introduction. In his monograph On Numbers and Games [7], J. H. Conway introduced a real-closed field containing the reals and the ordinals as well as a great many other numbers including ω, ω, /2, 1/ω, and ω − π to name only a few. Indeed, this particular real-closed field, which Conway calls No, is so remarkably inclusive that, subject to the proviso that numbers—construed here as members of ordered “number” fields—be individually definable in terms of sets of von Neumann-Bernays-Gödel set theory with Global Choice, henceforth NBG [cf. 21, Ch. 4], it may be said to contain “All Numbers Great and Small.” In this respect, No bears much the same relation to ordered fields that the system of real numbers bears to Archimedean ordered fields. This can be made precise by saying that whereas the ordered field of reals is (up to isomorphism) the unique homogeneous universal Archimedean ordered field, No is (up to isomorphism) the unique homogeneous universal orderedfield [14]; also see [10], [12], [13].However, in addition to its distinguished structure as an ordered field, No has a rich hierarchical structure that (implicitly) emerges from the recursive clauses in terms of which it is defined. This algebraico-tree-theoretic structure, or simplicity hierarchy, as we have called it [15], depends upon No's (implicit) structure as a lexicographically ordered binary tree and arises from the fact that the sums and products of any two members of the tree are the simplest possible elements of the tree consistent with No's structure as an ordered group and an ordered field, respectively, it being understood that x is simpler than y just in case x is a predecessor of y in the tree.

scholarly journals Models of true arithmetic are integer parts of models of real exponentation

2021 ◽  
Vol 13 ◽  
Author(s):  
Merlin Carl ◽  
Lothar Sebastian Krapp
Keyword(s):  
Multiplicative Group ◽  
Peano Arithmetic ◽  
Real Closed Field ◽  
Closed Field ◽  
Integer Part ◽  
Real Numbers ◽  
The Real ◽  
Positive Elements ◽  
Closed Fields ◽  
Schanuel's Conjecture

Exploring further the connection between exponentiation on real closed fields and the existence of an integer part modelling strong fragments of arithmetic, we demonstrate that each model of true arithmetic is an integer part of an exponential real closed field that is elementarily equivalent to the real numbers with exponentiation and that each model of Peano arithmetic is an integer part of a real closed field that admits an isomorphism between its ordered additive and its ordered multiplicative group of positive elements. Under the assumption of Schanuel’s Conjecture, we obtain further strengthenings for the last statement.

COMPARING TWO VERSIONS OF THE REALS

2016 ◽  
Vol 81 (3) ◽  
pp. 1115-1123
Author(s):  
G. IGUSA ◽  
J. F. KNIGHT
Keyword(s):  
Residue Field ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Numbers ◽  
Computing Power ◽  
Ordered Field ◽  
Image Position ◽  
Recursively Saturated

AbstractSchweber [10] defined a reducibility that allows us to compare the computing power of structures of arbitrary cardinality. Here we focus on the ordered field ${\cal R}$ of real numbers and a structure ${\cal W}$ that just codes the subsets of ω. In [10], it was observed that ${\cal W}$ is reducible to ${\cal R}$. We prove that ${\cal R}$ is not reducible to ${\cal W}$. As part of the proof, we show that for a countable recursively saturated real closed field ${\cal P}$ with residue field k, some copy of ${\cal P}$ does not compute a copy of k.

Wreath Products of Nonoverlapping Lattice Ordered Groups

1975 ◽  
Vol 17 (5) ◽  
pp. 713-722 ◽  
Author(s):  
John A. Read
Keyword(s):  
Wreath Product ◽  
Wreath Products ◽  
General Question ◽  
Real Numbers ◽  
Ordered Group ◽  
The Real ◽  
Ordered Groups ◽  
Lattice Ordered Groups ◽  
Totally Ordered Group ◽  
Product Of Subgroups

One of the fundamental tools in the theory of totally ordered groups is Hahn’s Theorem (a detailed discussion may be found in Fuchs [3]), which asserts, roughly, that every abelian totally ordered group can be embedded in a lexicographically ordered (unrestricted) direct sum of copies of the ordered group of real numbers. Almost any general question regarding the structure of abelian totally ordered groups can be answered by reference to Hahn’s theorem. For the class of nonabelian totally ordered groups, a theorem which parallels Hahn’s Theorem is given in [5], and states that each totally ordered group can be o-embedded in an ordered wreath product of subgroups of the real numbers. In order to extend this theorem to include an “if and only if” statement, one must consider lattice ordered groups, as an ordered wreath product of subgroups of the real numbers is, in general, not totally-ordered, but lattice ordered.

Relative randomness and real closed fields

2005 ◽  
Vol 70 (1) ◽  
pp. 319-330 ◽  
Author(s):  
Alexander Raichev
Keyword(s):  
Real Number ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Numbers ◽  
The Real ◽  
Real Closed Fields ◽  
Ordered Field ◽  
Closed Fields ◽  
Master's Thesis ◽  
National University

AbstractWe show that for any real number, the class of real numbers less random than it, in the sense of rK-reducibility, forms a countable real closed subfield of the real ordered field. This generalizes the well-known fact that the computable reals form a real closed field.With the same technique we show that the class of differences of computably enumerable reals (d.c.e. reals) and the class of computably approximable reals (c.a. reals) form real closed fields. The d.c.e. result was also proved nearly simultaneously and independently by Ng (Keng Meng Ng, Master's Thesis, National University of Singapore, in preparation).Lastly, we show that the class of d.c.e. reals is properly contained in the class or reals less random than Ω (the halting probability), which in turn is properly contained in the class of c.a. reals, and that neither the first nor last class is a randomness class (as captured by rK-reducibility).

The Absolute Arithmetic Continuum and the Unification Of all Numbers Great and Small

2012 ◽  
Vol 18 (1) ◽  
pp. 1-45 ◽  
Author(s):  
Philip Ehrlich
Keyword(s):  
Nonstandard Analysis ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Numbers ◽  
Von Neumann ◽  
Ordered Field ◽  
Number Systems ◽  
Ordered Fields ◽  
Archimedean Axiom ◽  
Hierarchical Features

AbstractIn his monograph On Numbers and Games, J. H. Conway introduced a real-closed field containing the reals and the ordinals as well as a great many less familiar numbers including −ω, ω/2, 1/ω, and ω − π to name only a few. Indeed, this particular real-closed field, which Conway calls No, is so remarkably inclusive that, subject to the proviso that numbers—construed here as members of ordered fields—be individually definable in terms of sets of NBG (von Neumann–Bernays–Gödel set theory with global choice), it may be said to contain “All Numbers Great and Small.” In this respect, No bears much the same relation to ordered fields that the system ℝ of real numbers bears to Archimedean ordered fields.In Part I of the present paper, we suggest that whereas ℝ should merely be regarded as constituting an arithmetic continuum (modulo the Archimedean axiom), No may be regarded as a sort of absolute arithmetic continuum (modulo NBG), and in Part II we draw attention to the unifying framework No provides not only for the reals and the ordinals but also for an array of non-Archimedean ordered number systems that have arisen in connection with the theories of non-Archimedean ordered algebraic and geometric systems, the theory of the rate of growth of real functions and nonstandard analysis.In addition to its inclusive structure as an ordered field, the system No of surreal numbers has a rich algebraico-tree-theoretic structure—a simplicity hierarchical structure—that emerges from the recursive clauses in terms of which it is defined. In the development of No outlined in the present paper, in which the surreals emerge vis-à-vis a generalization of the von Neumann ordinal construction, the simplicity hierarchical features of No are brought to the fore and play central roles in the aforementioned unification of systems of numbers great and small and in some of the more revealing characterizations of No as an absolute continuum.

scholarly journals On the Cardinality of A Semi-Algebraic Set

1994 ◽  
Vol 1 (3) ◽  
pp. 277-286
Author(s):  
G. Khimshiashvili
Keyword(s):  
Quadratic Forms ◽  
Real Closed Field ◽  
Closed Field ◽  
Algebraic Subset ◽  
Algebraic Set

Abstract It is shown that the cardinality of a finite semi-algebraic subset over a real closed field can be computed in terms of signatures of effectively constructed quadratic forms.

Equations and Complexity for the Dubois–Efroymson Dimension Theorem

2009 ◽  
Vol 52 (2) ◽  
pp. 224-236
Author(s):  
Riccardo Ghiloni
Keyword(s):  
Real Closed Field ◽  
Closed Field ◽  
Algebraic Subset ◽  
Algebraically Closed Field ◽  
Algebraic Set ◽  
Real Algebraic Set ◽  
Nonsingular Point ◽  
Minimum Integer ◽  
The Ideal

AbstractLetRbe a real closed field, letX⊂Rnbe an irreducible real algebraic set and letZbe an algebraic subset ofXof codimension ≥ 2. Dubois and Efroymson proved the existence of an irreducible algebraic subset ofXof codimension 1 containingZ. We improve this dimension theorem as follows. Indicate by μ the minimum integer such that the ideal of polynomials inR[x1, … ,xn] vanishing onZcan be generated by polynomials of degree ≤ μ. We prove the following two results: (1) There exists a polynomialP∈R[x1, … ,xn] of degree≤ μ+1 such thatX∩P–1(0) is an irreducible algebraic subset ofXof codimension 1 containingZ. (2) LetFbe a polynomial inR[x1, … ,xn] of degreedvanishing onZ. Suppose there exists a nonsingular pointxofXsuch thatF(x) = 0 and the differential atxof the restriction ofFtoXis nonzero. Then there exists a polynomialG∈R[x1, … ,xn] of degree ≤ max﹛d, μ + 1﹜ such that, for eacht∈ (–1, 1) \ ﹛0﹜, the set ﹛x∈X|F(x) +tG(x) = 0﹜ is an irreducible algebraic subset ofXof codimension 1 containingZ. Result (1) and a slightly different version of result (2) are valid over any algebraically closed field also.

The model theory of ordered differential fields

1978 ◽  
Vol 43 (1) ◽  
pp. 82-91 ◽  
Author(s):  
Michael F. Singer
Keyword(s):  
Meromorphic Functions ◽  
Analytic Solutions ◽  
Positive Element ◽  
Real Closed Field ◽  
Real Field ◽  
Closed Field ◽  
Ordered Field ◽  
Positive Elements ◽  
Odd Degree ◽  
Differential Fields

In this paper, we show that the theory of ordered differential fields has a model completion. We also show that any real differential field, finitely generated over the rational numbers, is isomorphic to some field of real meromorphic functions. In the last section of this paper, we combine these two results and discuss the problem of deciding if a system of differential equations has real analytic solutions. The author wishes to thank G. Stengle for some stimulating and helpful conversations and for drawing our attention to fields of real meromorphic functions.§ 1. Real and ordered fields. A real field is a field in which −1 is not a sum of squares. An ordered field is a field F together with a binary relation < which totally orders F and satisfies the two properties: (1) If 0 < x and 0 < y then 0 < xy. (2) If x < y then, for all z in F, x + z < y + z. An element x of an ordered field is positive if x > 0. One can see that the square of any element is positive and that the sum of positive elements is positive. Since −1 is not positive, an ordered field is a real field. Conversely, given a real field F, it is known that one can define an ordering (not necessarily uniquely) on F [2, p. 274]. An ordered field F is a real closed field if: (1) every positive element is a square, and (2) every polynomial of odd degree with coefficients in F has a root in F. For example, the real numbers form a real closed field. Every ordered field can be embedded in a real closed field. It is also known that, in a real closed field K, polynomials satisfy the intermediate value property, i.e. if f(x) ∈ K[x] and a, b ∈ K, a < b, and f(a)f(b) < 0 then there is a c in K such that f(c) = 0.

Sign in / Sign up

Export Citation Format

Share Document