Some Subfields of Qp, and their Non-Standard Analogues

1974 ◽  
Vol 26 (02) ◽  
pp. 473-491
Author(s):  
Diana L. Dubrovsky
Keyword(s):  
Algebraic Structure ◽  
Recursion Theory ◽  
Algebraic Structures ◽  
Mathematical Structures ◽  
Closed Fields ◽  
Standard Models ◽  
Algebraically Closed Fields

The desire to study constructive properties of given mathematical structures goes back many years; we can perhaps mention L. Kronecker and B. L. van der Waerden, two pioneers in this field. With the development of recursion theory it was possible to make precise the notion of "effectively carrying out" the operations in a given algebraic structure. Thus, A. Frölich and J. C. Shepherdson [7] and M. O . Rabin [13] studied computable algebraic structures, i.e. structures whose operations can be viewed as recursive number theoretic relations. A. Robinson [18] and E. W. Madison [11] used the concepts of computable and arithmetically definable structures in order to establish the existence of what can be called non-standard analogues (in a sense that will be specified later) of certain subfields of R and C, the standard models for the theories of real closed and algebraically closed fields respectively.

Recursion theory in a lower semilattice

1992 ◽  
Vol 57 (3) ◽  
pp. 892-911 ◽  
Author(s):  
Alex Feldman
Keyword(s):  
Lower Bound ◽  
Partial Order ◽  
Algebraic Structure ◽  
Algebraic Closure ◽  
Recursion Theory ◽  
Vector Spaces ◽  
Algebraic Structures ◽  
Recursively Enumerable ◽  
Closed Fields ◽  
Algebraically Closed Fields

In §3 we construct a universal, ℵ0-categorical recursively presented partial order with greatest lower bound operator. This gives us the unique structure which embeds every countable lower semilattice. In §§5 and 6 we investigate the recursive and recursively enumerable substructures of this structure, in particular finding a suitable definition for the simple-maximal hierarchy and giving an example of an infinite recursively enumerable substructure which does not contain any infinite recursive substructure.The idea of looking at the lattice of recursively enumerable substructures of some recursive algebraic structure was introduced by Metakides and Nerode in [5], and since then many different kinds of algebraic structures have been studied in this way, including vector spaces, Boolean algebras, groups, algebraically closed fields, and equivalence relations. Since different algebraic structures have different recursion theoretic properties, one natural question is whether an algebraic structure with relatively little structure (such as a partial order or an equivalence relation) exhibits behavior more like classical recursion theory than one with more structure (such as vector spaces or algebraically closed fields).In [6] and [7], Metakides and Remmel studied recursion theory on orderings, and, as they point out in [6], orderings differ from most other algebraic structures in that the algebraic closure operation on orderings is trivial; but this does not present a problem for them, given the questions they explore. Moreover, they take an approach of proving general theorems which can then be applied to specific orderings. Our tack is different, although also well-established (see, for example, [3]), in which a “largest” structure is defined (in §3) which corresponds to the natural numbers in classical recursion theory. In order to distinguish substructures from subsets, a function symbol is added, namely greatest lower bound. The greatest lower bound function is fundamental to the study of orderings and occurs naturally in many of them, and thus is an appropriate addition to the theory of orderings. In §4 we redefine the concepts of simple and maximal in a manner appropriate to this structure, and prove several existence theorems.

Recursion theory on orderings. I. A model theoretic setting

1979 ◽  
Vol 44 (3) ◽  
pp. 383-402 ◽  
Author(s):  
G. Metakides ◽  
J.B. Remmel
Keyword(s):  
Algebraic Closure ◽  
Recursion Theory ◽  
Boolean Algebras ◽  
Vector Spaces ◽  
Formal Definition ◽  
Recursively Enumerable ◽  
Closed Fields ◽  
Partial Orderings ◽  
Definition Of ◽  
Algebraically Closed Fields

In [6], Metakides and Nerode introduced the study of the lattice of recursively enumerable substructures of a recursively presented model as a means to understand the recursive content of certain algebraic constructions. For example, the lattice of recursively enumerable subspaces,, of a recursively presented vector spaceV∞has been studied by Kalantari, Metakides and Nerode, Retzlaff, Remmel and Shore. Similar studies have been done by Remmel [12], [13] for Boolean algebras and by Metakides and Nerode [9] for algebraically closed fields. In all of these models, the algebraic closure of a set is nontrivial. (The formal definition of the algebraic closure of a setS, denoted cl(S), is given in §1, however in vector spaces, cl(S) is just the subspace generated byS, in Boolean algebras, cl(S) is just the subalgebra generated byS, and in algebraically closed fields, cl(S) is just the algebraically closed subfield generated byS.)In this paper, we give a general model theoretic setting (whose precise definition will be given in §1) in which we are able to give constructions which generalize many of the constructions of classical recursion theory. One of the main features of the modelswhich we study is that the algebraic closure of setis just itself, i.e., cl(S) = S. Examples of such models include the natural numbers under equality 〈N, = 〉, the rational numbers under the usual ordering 〈Q, ≤〉, and a large class ofn-dimensional partial orderings.

Ordinal spectra of first-order theories

1977 ◽  
Vol 42 (4) ◽  
pp. 492-505 ◽  
Author(s):  
John Stewart Schlipf
Keyword(s):  
Recent Work ◽  
Information Content ◽  
Recursion Theory ◽  
Admissible Set ◽  
First Order ◽  
Admissible Sets ◽  
Closed Fields ◽  
Algebraically Closed Fields ◽  
Basic Treatment

The notion of the next admissible set has proved to be a very useful notion in definability theory and generalized recursion theory, a unifying notion that has produced further interesting results in its own right. The basic treatment of the next admissible set above a structure ℳ of urelements is to be found in Barwise's [75] book Admissible sets and structures. Also to be found there are many of the interesting characterizations of the next admissible set. For further justification of the interest of the next admissible set the reader is referred to Moschovakis [74], Nadel and Stavi [76] and Schlipf [78a, b, c].One of the most interesting single properties of is its ordinal (ℳ). It coincides, for example, with Moschovakis' inductive closure ordinal over structures ℳ with pairing functions—and over some, such as algebraically closed fields of characteristic 0, without pairing functions (by recent work of Arthur Rubin) (although a locally famous counterexample of Kunen, a theorem of Barwise [77], and some recent results of Rubin and the author, show that the inductive closure ordinal may also be strictly smaller in suitably pathological structures). Further justification for looking at (ℳ) alone may be found in the above-listed references. Loosely, we can consider the size of to be a useful measure of the complexity of ℳ. One of the simplest measures of the size of —and yet a very useful measure—is its ordinal, (ℳ). Keisler has suggested thinking of (ℳ) as the information content of a model—the supremum of lengths of wellfounded relations characterizable in the model.

scholarly journals Perfect pseudo-algebraically closed fields are algebraically bounded

2004 ◽  
Vol 271 (2) ◽  
pp. 627-637 ◽  
Author(s):  
Zoé Chatzidakis ◽  
Ehud Hrushovski
Keyword(s):  
Closed Fields ◽  
Algebraically Closed Fields

scholarly journals Nilpotent orbits of exceptional Lie algebras over algebraically closed fields of bad characteristic

1985 ◽  
Vol 38 (3) ◽  
pp. 330-350 ◽  
Author(s):  
D. F. Holt ◽  
N. Spaltenstein
Keyword(s):  
Finite Field ◽  
Lie Algebras ◽  
Closed Field ◽  
Nilpotent Orbits ◽  
Reductive Algebraic Group ◽  
Exceptional Lie Algebras ◽  
Closed Fields ◽  
Characteristic 3 ◽  
Algebraically Closed Fields

AbstractThe classification of the nilpotent orbits in the Lie algebra of a reductive algebraic group (over an algebraically closed field) is given in all the cases where it was not previously known (E7 and E8 in bad characteristic, F4 in characteristic 3). The paper exploits the tight relation with the corresponding situation over a finite field. A computer is used to study this case for suitable choices of the finite field.

scholarly journals Adelic descent theory

2017 ◽  
Vol 153 (8) ◽  
pp. 1706-1746
Author(s):  
Michael Groechenig
Keyword(s):  
Vector Bundles ◽  
Continuous Functions ◽  
Topological Spaces ◽  
Reductive Algebraic Group ◽  
Perfect Complexes ◽  
Descent Theory ◽  
Closed Fields ◽  
Ring Of Continuous Functions ◽  
Reconstruction Theorem ◽  
Algebraically Closed Fields

A result of André Weil allows one to describe rank $n$ vector bundles on a smooth complete algebraic curve up to isomorphism via a double quotient of the set $\text{GL}_{n}(\mathbb{A})$ of regular matrices over the ring of adèles (over algebraically closed fields, this result is also known to extend to $G$-torsors for a reductive algebraic group $G$). In the present paper we develop analogous adelic descriptions for vector and principal bundles on arbitrary Noetherian schemes, by proving an adelic descent theorem for perfect complexes. We show that for Beilinson’s co-simplicial ring of adèles $\mathbb{A}_{X}^{\bullet }$, we have an equivalence $\mathsf{Perf}(X)\simeq |\mathsf{Perf}(\mathbb{A}_{X}^{\bullet })|$ between perfect complexes on $X$ and cartesian perfect complexes for $\mathbb{A}_{X}^{\bullet }$. Using the Tannakian formalism for symmetric monoidal $\infty$-categories, we conclude that a Noetherian scheme can be reconstructed from the co-simplicial ring of adèles. We view this statement as a scheme-theoretic analogue of Gelfand–Naimark’s reconstruction theorem for locally compact topological spaces from their ring of continuous functions. Several results for categories of perfect complexes over (a strong form of) flasque sheaves of algebras are established, which might be of independent interest.

scholarly journals Intersections of algebraically closed fields

1986 ◽  
Vol 30 (2) ◽  
pp. 103-119 ◽  
Author(s):  
C.J. Ash ◽  
John W. Rosenthal
Keyword(s):  
Closed Fields ◽  
Algebraically Closed Fields
Sign in / Sign up

Export Citation Format

Share Document