scholarly journals On the elementary theory of pairs of real closed fields. II

1982 ◽  
Vol 47 (3) ◽  
pp. 669-679 ◽  
Author(s):  
Walter Baur
Keyword(s):  
Power Series ◽  
Abelian Groups ◽  
Elementary Theory ◽  
Predicate Symbol ◽  
Axiom System ◽  
Closed Field ◽  
Algebraic Numbers ◽  
Real Closed Fields ◽  
Order Language ◽  
Closed Fields

Let ℒ be the first order language of field theory with an additional one place predicate symbol. In [B2] it was shown that the elementary theory T of the class of all pairs of real closed fields, i.e., ℒ-structures ‹K, L›, K a real closed field, L a real closed subfield of K, is undecidable.The aim of this paper is to show that the elementary theory Ts of a nontrivial subclass of containing many naturally occurring pairs of real closed fields is decidable (Theorem 3, §5). This result was announced in [B2]. An explicit axiom system for Ts will be given later. At this point let us just mention that any model of Ts, is elementarily equivalent to a pair of power series fields ‹R0((TA)), R1((TB))› where R0 is the field of real numbers, R1 = R0 or the field of real algebraic numbers, and B ⊆ A are ordered divisible abelian groups. Conversely, all these pairs of power series fields are models of Ts.Theorem 3 together with the undecidability result in [B2] answers some of the questions asked in Macintyre [M]. The proof of Theorem 3 uses the model theoretic techniques for valued fields introduced by Ax and Kochen [A-K] and Ershov [E] (see also [C-K]). The two main ingredients are(i) the completeness of the elementary theory of real closed fields with a distinguished dense proper real closed subfield (due to Robinson [R]),(ii) the decidability of the elementary theory of pairs of ordered divisible abelian groups (proved in §§1-4).I would like to thank Angus Macintyre for fruitful discussions concerning the subject. The valuation theoretic method of classifying theories of pairs of real closed fields is taken from [M].

Decidable regularly closed fields of algebraic numbers

1985 ◽  
Vol 50 (2) ◽  
pp. 468-475 ◽  
Author(s):  
Lou van den Dries ◽  
Rick L. Smith
Keyword(s):  
Galois Group ◽  
Elementary Theory ◽  
Algebraic Closure ◽  
Closed Field ◽  
Algebraic Numbers ◽  
Integer Polynomials ◽  
Forthcoming Book ◽  
Closed Fields ◽  
Free Profinite Group ◽  
Theoretic Argument

A field K is regularly closed if every absolutely irreducible affine variety defined over K has K-rational points. This notion was first isolated by Ax [A] in his work on the elementary theory of finite fields. Later Jarden [J2] and Jarden and Kiehne [JK] extended this in different directions. One of the primary results in this area is that the elementary properties of a regularly closed field K with a free Galois group (on either finitely or countably many generators) are determined by the set of integer polynomials in one indeterminate with a zero in K. The method of proof employed in [J1], [J2] and [JK] is unusual for algebra since it is a measure-theoretic argument. In this brief summary we have not made any attempt at completeness. We refer the reader to the recent paper of Cherlin, van den Dries, and Macintyre [CDM] and to the forthcoming book by Fried and Jarden [FJ] for a more thorough discussion of the latest results. We would like to thank Moshe Jarden, Angus Macintyre, and Zoe Chatzidakis for their comments on an earlier version of this paper.A countable field K is ω-free if the absolute Galois group , where is the algebraic closure of K and is the free profinite group on ℵ0 generators.

Omitting types in -minimal theories

1986 ◽  
Vol 51 (1) ◽  
pp. 63-74 ◽  
Author(s):  
David Marker
Keyword(s):  
Finite Union ◽  
Structure Theory ◽  
Real Closed Fields ◽  
Minimal Theory ◽  
Order Language ◽  
Closed Fields ◽  
Hanf Number ◽  
Definable Sets ◽  
Omitting Types ◽  
Binary Relation Symbol

Let L be a first order language containing a binary relation symbol <.Definition. Suppose ℳ is an L-structure and < is a total ordering of the domain of ℳ. ℳ is ordered minimal (-minimal) if and only if any parametrically definable X ⊆ ℳ can be represented as a finite union of points and intervals with endpoints in ℳ.In any ordered structure every finite union of points and intervals is definable. Thus the -minimal structures are the ones with no unnecessary definable sets. If T is a complete L-theory we say that T is strongly (-minimal if and only if every model of T is -minimal.The theory of real closed fields is the canonical example of a strongly -minimal theory. Strongly -minimal theories were introduced (in a less general guise which we discuss in §6) by van den Dries in [1]. Extending van den Dries' work, Pillay and Steinhorn (see [3], [4] and [2]) developed an extensive structure theory for definable sets in strongly -minimal theories, generalizing the results for real closed fields. They also established several striking analogies between strongly -minimal theories and ω-stable theories (most notably the existence and uniqueness of prime models). In this paper we will examine the construction of models of strongly -minimal theories emphasizing the problems involved in realizing and omitting types. Among other things we will prove that the Hanf number for omitting types for a strongly -minimal theory T is at most (2∣T∣)+, and characterize the strongly -minimal theories with models order isomorphic to (R, <).

scholarly journals Involutions on finite-dimensional algebras over real closed fields

2004 ◽  
Vol 77 (1) ◽  
pp. 123-128 ◽  
Author(s):  
W. D. Munn
Keyword(s):  
Characteristic Zero ◽  
Real Closed Field ◽  
Closed Field ◽  
Finite Dimensional Algebra ◽  
Dimensional Algebra ◽  
Algebraically Closed Field ◽  
Real Closed Fields ◽  
Finite Dimensional ◽  
Closed Fields ◽  
Finite Dimensional Algebras

AbstractIt is shown that the following conditions on a finite-dimensional algebra A over a real closed field or an algebraically closed field of characteristic zero are equivalent: (i) A admits a special involution, in the sense of Easdown and Munn, (ii) A admits a proper involution, (iii) A is semisimple.

ON THE CLASSIFICATION OF CENTRALLY FINITE ALTERNATIVE DIVISION RINGS SATISFYING ALGEBRAIC CLOSURE CONDITIONS

2012 ◽  
Vol 11 (05) ◽  
pp. 1250088
Author(s):  
RICCARDO GHILONI
Keyword(s):  
Algebraic Closure ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Closed Fields ◽  
Division Rings ◽  
Closed Fields ◽  
Closure Conditions ◽  
The One ◽  
Algebraically Closed Fields

In this paper, we prove that the rings of quaternions and of octonions over an arbitrary real closed field are algebraically closed in the sense of Eilenberg and Niven. As a consequence, we infer that some reasonable algebraic closure conditions, including the one of Eilenberg and Niven, are equivalent on the class of centrally finite alternative division rings. Furthermore, we classify centrally finite alternative division rings satisfying such equivalent algebraic closure conditions: up to isomorphism, they are either the algebraically closed fields or the rings of quaternions over real closed fields or the rings of octonions over real closed fields.

The undecidability of intuitionistic theories of algebraically closed fields and real closed fields

1973 ◽  
Vol 38 (1) ◽  
pp. 86-92 ◽  
Author(s):  
Dov M. Gabbay
Keyword(s):  
Classical Theory ◽  
Linear Order ◽  
Abelian Groups ◽  
Classical Model ◽  
Sufficient Conditions ◽  
Interesting Case ◽  
Real Closed Fields ◽  
Closed Fields ◽  
Intuitionistic Theory ◽  
Algebraically Closed Fields

Let T be a set of axioms for a classical theory TC (e.g. abelian groups, linear order, unary function, algebraically closed fields, etc.). Suppose we regard T as a set of axioms for an intuitionistic theory TH (more precisely, we regard T as axioms in Heyting's predicate calculus HPC).Question. Is TH decidable (or, more generally, if X is any intermediate logic, is TX decidable)? In [1] we gave sufficient conditions for the undecidability of TH. These conditions depend on the formulas of T (different axiomatization of the same TC may give rise to different TH) and on the classical model theoretic properties of TC (the method did not work for model complete theories, e.g. those of the title of the paper). For details see [1]. In [2] we gave some decidability results for some theories: The problem of the decidability of theories TH for a classically model complete TC remained open. An undecidability result in this direction, for dense linear order was obtained by Smorynski [4]. The cases of algebraically closed fields and real closed fields and divisible abelian groups are treated in this paper. Other various decidability results of the intuitionistic theories were obtained by several authors, see [1], [2], [4] for details.One more remark before we start. There are several possible formulations for an intuitionistic theory of, e.g. fields, that correspond to several possible axiomatizations of the classical theory. Other formulations may be given in terms of the apartness relation, such as the one for fields given by Heyting [5]. The formulations that we consider here are of interest as these systems occur in intuitionistic mathematics. We hope that the present methods could be extended to the (more interesting) case of Heyting's systems [5].

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).

Definable types in -minimal theories

1994 ◽  
Vol 59 (1) ◽  
pp. 185-198 ◽  
Author(s):  
David Marker ◽  
Charles I. Steinhorn
Keyword(s):  
Stability Theory ◽  
Conservative Extension ◽  
Absolute Value ◽  
First Order ◽  
Real Closed Fields ◽  
Order Language ◽  
Closed Fields ◽  
Models Of Arithmetic

Let L be a first order language. If M is an L-structure, let LM be the expansion of L obtained by adding constants for the elements of M.Definition. A type is definable if and only if for any L-formula , there is an LM-formula so that for all iff M ⊨ dθ(¯). The formula dθ is called the definition of θ.Definable types play a central role in stability theory and have also proven useful in the study of models of arithmetic. We also remark that it is well known and easy to see that for M ≺ N, the property that every M-type realized in N is definable is equivalent to N being a conservative extension of M, whereDefinition. If M ≺ N, we say that N is a conservative extension of M if for any n and any LN -definable S ⊂ Nn, S ∩ Mn is LM-definable in M.Van den Dries [Dl] studied definable types over real closed fields and proved the following result.0.1 (van den Dries), (i) Every type over (R, +, -,0,1) is definable.(ii) Let F and K be real closed fields and F ⊂ K. Then, the following are equivalent:(a) Every element of K that is bounded in absolute value by an element of F is infinitely close (in the sense of F) to an element of F.(b) K is a conservative extension of F.

The elementary theory of free pseudo p-adically closed fields of finite corank

1991 ◽  
Vol 56 (2) ◽  
pp. 484-496 ◽  
Author(s):  
Ido Efrat
Keyword(s):  
Rational Point ◽  
Elementary Theory ◽  
Valuation Rings ◽  
Order Language ◽  
Irreducible Variety ◽  
Closed Fields ◽  
Free Profinite Group ◽  
Unary Relation ◽  
Adic Valuation ◽  
Almost All

Let be p-adic closures of a countable Hilbertian field K. The main result of [EJ] asserts that the field has the following properties for almost all σ1,…,σe + m ϵ G(K) (in the sense of the unique Haar measure on G(K)e+m):(a) Kσ is pseudo p-adically closed (abbreviation: PpC), i.e., each nonempty absolutely irreducible variety defined over Kσ has a Kσ-rational point, provided that it has a simple rational point in each p-adic closure of Kσ.(b) G(Kσ) ≅ De,m, where De,m is the free profinite product of e copies Γ1,…, Γe of G(ℚp) and a free profinite group of rank m.(c) Kσ has exactly e nonequivalent p-adic valuation rings. They are the restrictions Oσ1,…, Oσe of the unique p-adic valuation rings on , respectively.In this paper we show that this result is in a certain sense the best possible. More precisely, we first show that the class of fields which satisfy (a)–(c) above is elementary in the appropriate language e(K), which is the ordinary first-order language of rings augmented by constant symbols for the elements of K and by e new unary relation symbols (interpreted as e p-adic valuation rings).

A note on valuation definable expansions of fields

1998 ◽  
Vol 63 (2) ◽  
pp. 739-743 ◽  
Author(s):  
Deirdre Haskell ◽  
Dugald Macpherson
Keyword(s):  
Valuation Ring ◽  
Quantifier Elimination ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Closed Fields ◽  
Ordered Field ◽  
Valued Field ◽  
Closed Fields ◽  
Binary Predicate ◽  
Algebraically Closed Fields

In this note, we consider models of the theories of valued algebraically closed fields and convexly valued real closed fields, their reducts to the pure field or ordered field language respectively, and expansions of these by predicates which are definable in the valued field. We show that, in terms of definability, there is no structure properly between the pure (ordered) field and the valued field. Our results are analogous to several other definability results for reducts of algebraically closed and real closed fields; see [9], [10], [11] and [12]. Throughout this paper, definable will mean definable with parameters.Theorem A. Let ℱ = (F, +, ×, V) be a valued, algebraically closed field, where V denotes the valuation ring. Let A be a subset ofFndefinable in ℱv. Then either A is definable in ℱ = (F, +, ×) or V is definable in.Theorem B. Let ℛv = (R, <, +, ×, V) be a convexly valued real closed field, where V denotes the valuation ring. Let Abe a subset ofRndefinable in ℛv. Then either A is definable in ℛ = (R, <, +, ×) or V is definable in.The proofs of Theorems A and B are quite similar. Both ℱv and ℛv admit quantifier elimination if we adjoin a definable binary predicate Div (interpreted by Div(x, y) if and only if v(x) ≤ v(y)). This is proved in [14] (extending [13]) in the algebraically closed case, and in [4] in the real closed case. We show by direct combinatorial arguments that if the valuation is not definable then the expanded structure is strongly minimal or o-minimal respectively. Then we call on known results about strongly minimal and o-minimal fields to show that the expansion is not proper.

scholarly journals THE NON-AXIOMATIZABILITY OF O-MINIMALITY

2014 ◽  
Vol 79 (01) ◽  
pp. 54-59 ◽  
Author(s):  
ALEX RENNET
Keyword(s):  
Function Symbol ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Closed Fields ◽  
Ordered Fields ◽  
Closed Fields

Abstract Fix a language extending the language of ordered fields by at least one new predicate or function symbol. Call an L-structure R pseudo-o-minimal if it is (elementarily equivalent to) an ultraproduct of o-minimal structures. We show that for any recursive list of L-sentences , there is a real closed field satisfying which is not pseudo-o-minimal. This shows that the theory To−min consisting of those -sentences true in all o-minimal -structures, also called the theory of o-minimality (for L), is not recursively axiomatizable. And, in particular, there are locally o-minimal, definably complete expansions of real closed fields which are not pseudo-o-minimal.

Sign in / Sign up

Export Citation Format

Share Document