Recursively presentable prime models

1974 ◽  
Vol 39 (2) ◽  
pp. 305-309 ◽  
Author(s):  
Leo Harrington
Keyword(s):  
Decision Procedure ◽  
Positive Answer ◽  
Prime Model ◽  
Property A ◽  
Categorical Theory ◽  
Decidable Theory ◽  
Free Variables ◽  
Closed Fields ◽  
Countable Theory ◽  
Algebraically Closed Fields

It is well known that a decidable theory possesses a recursively presentable model. If a decidable theory also possesses a prime model, it is natural to ask if the prime model has a recursive presentation. This has been answered affirmatively for algebraically closed fields [5], and for real closed fields, Hensel fields and other fields [3]. This paper gives a positive answer for the theory of differentially closed fields, and for any decidable ℵ1-categorical theory.The language of a theory T is denoted by L(T). All languages will be presumed countable. An x-type of T is a set of formulas with free variables x, which is consistent with T and which is maximal in this property. A formula with free variables x is complete if there is exactly one x-type containing it. A type is principal if it contains a complete formula. A countable model of T is prime if it realizes only principal types. Vaught has shown that a complete countable theory can have at most one prime model up to isomorphism.If T is a decidable theory, then the decision procedure for T equips L(T) with an effective counting. Thus the formulas of L(T) correspond to integers. The integer a formula φ(x) corresponds to is generally called the Gödel number of φ(x) and is denoted by ⌜φ(x)⌝. The usual recursion theoretic notions defined on the set of integers can be transferred to L(T). In particular a type Γ is recursive with index e if {⌜φ⌝.; φ ∈ Γ} is a recursive set of integers with index e.

Some theories associated with algebraically closed fields

1980 ◽  
Vol 45 (2) ◽  
pp. 359-362 ◽  
Author(s):  
Chris Ash ◽  
John Rosenthal
Keyword(s):  
Characteristic Zero ◽  
Algebraic Independence ◽  
Transcendence Degree ◽  
Rational Field ◽  
Partial Differentiation ◽  
Decidable Theory ◽  
Closed Fields ◽  
Algebraically Closed Fields

We consider the effect on decidability of adding, to the decidable theory of algebraically closed fields of characteristic zero, relation symbols for algebraic independence or function symbols for differentiation. Our results show that the corresponding theories are usually undeeidable.Let k and K be algebraically closed fields of characteristic zero. Let K be an extension of k of transcendence degree n over k. Since k has characteristic 0, we may assume that the rational field, Q, is a subfield of k.Let Indn be the n-ary relation on K which holds for exactly those n-tuples from K which are algebraically independent over k.Let x1, …, xn be a transcendence base for K over k. For i = 1, 2, …, n, let Di: K → K be the partial differentiation function with respect to xi and this base.Let KnInd = (K, +, ·, Indn), n ≤ 1 and let KnDiff = (K, +, ·, D1, …, Dn), n ≤ 1 where K has transcendence degree n over k.We show that the theories of these structures are independent of k when k has infinite transcendence degree over Q, that KnDiff has undeeidable theory for n ≤ 1 and that KnInd has undeeidable theory for n ≤ 2. The theory of K1Ind is decidable.

Number of countable models

1978 ◽  
Vol 43 (3) ◽  
pp. 492-496 ◽  
Author(s):  
Anand Pillay
Keyword(s):  
Finite Number ◽  
Complete Theory ◽  
Prime Model ◽  
Categorical Theory ◽  
Definable Subset ◽  
Algebraic Elements ◽  
Minimal Prime ◽  
Countable Theory ◽  
The Universe ◽  
Countable Models

We prove that a countable complete theory whose prime model has an infinite definable subset, all of whose elements are named, has at least four countable models up to isomorphism. The motivation for this is the conjecture that a countable theory with a minimal model has infinitely many countable models. In this connection we first prove that a minimal prime model A has an expansion by a finite number of constants A′ such that the set of algebraic elements of A′ contains an infinite definable subset.We note that our main conjecture strengthens the Baldwin–Lachlan theorem. We also note that due to Vaught's result that a countable theory cannot have exactly two countable models, the weakest possible nontrivial result for a non-ℵ0-categorical theory is that it has at least four countable models.§1. Notation and preliminaries. Our notation follows Chang and Keisler [1], except that we denote models by A, B, etc. We use the same symbol to refer to the universe of a model. Models we refer to are always in a countable language. For T a countable complete theory we let n(T) be the number of countable models of T up to isomorphism. ∃n means ‘there are exactly n’.

Classifying model-theoretic properties

2008 ◽  
Vol 73 (3) ◽  
pp. 885-905 ◽  
Author(s):  
Chris J. Conidis
Keyword(s):  
Model Theory ◽  
Computability Theory ◽  
Prime Model ◽  
Decidable Theory ◽  
Dense Sets ◽  
Equivalent Properties ◽  
The Relationship

AbstractIn 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A ≤T 0′ is nonlow2 if and only if A is prime bounding, i.e., for every complete atomic decidable theory T, there is a prime model computable in A. The authors presented nine seemingly unrelated predicates of a set A, and showed that they are equivalent for sets. Some of these predicates, such as prime bounding, and others involving equivalence structures and abelian p-groups come from model theory, while others involving meeting dense sets in trees and escaping a given function come from pure computability theory.As predicates of A, the original nine properties are equivalent for sets; however, they are not equivalent in general. This article examines the (degree-theoretic) relationship between the nine properties. We show that the nine properties fall into three classes, each of which consists of several equivalent properties. We also investigate the relationship between the three classes, by determining whether or not any of the predicates in one class implies a predicate in another class.

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

Indiscernibles and decidable models

1983 ◽  
Vol 48 (1) ◽  
pp. 21-32 ◽  
Author(s):  
H. A. Kierstead ◽  
J. B. Remmel
Keyword(s):  
Order Theory ◽  
Stable Theory ◽  
Categorical Theory ◽  
Large Classes ◽  
Decidable Theory ◽  
First Order Theory ◽  
Decidable Model ◽  
Decidable Theories ◽  
Basic Facts ◽  
Infinite Set

Ehrenfeucht and Mostowski [3] introduced the notion of indiscernibles and proved that every first order theory has a model with an infinite set of order indiscernibles. Since their work, techniques involving indiscernibles have proved to be extremely useful for constructing models with various specialized properties. In this paper and in a sequel [5], we investigate the effective content of Ehrenfeucht's and Mostowski's result. In this paper we consider the question of which decidable theories have decidable models with infinite recursive sets of indiscernibles. In §1, using some basic facts from stability theory, we show that certain large classes of decidable theories have decidable models with infinite recursive sets of indiscernibles. For example, we show that every ω-stable decidable theory and every stable theory which possesses a certain strong decidability property called ∃Q-decidability have such models. In §2 we construct several examples of decidable theories which have no decidable models with infinite recursive sets of indiscernibles. These examples show that our hypothesis for our positive results in §1 are necessary. Finally in §3 we give two applications of our results. First as an easy application of our results in §1, we show that every ω-stable decidable theory has uncountable models which realize only recursive types. Also our counterexamples in §2 allow us to answer negatively two questions of Baldwin and Kueker [1] concerning the effectiveness of their elimination of Ramsey quantifiers for certain theories.In [5], we show that in general the problem of finding an infinite set of indiscernibles in a decidable model is recursively equivalent to finding a path through a recursive infinite branching tree. Similarly, we show that the problem of finding an co-type of a set of indiscernibles in a decidable ω-categorical theory is recursively equivalent to finding a path through a highly recursive finitely branching tree.

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