zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Model theory: An introduction. (English) Zbl 1003.03034
Graduate Texts in Mathematics. 217. New York, NY: Springer. viii, 342 p. EUR 64.95/net; sFr. 108.00; £45.50; $ 59.95 (2002).

The author’s intended audience for this high level introduction to model theory is graduate students contemplating research in model theory, graduate students in logic, and mathematicians who are not logicians but who are in areas where model theory has interesting applications. His goal in writing this text is to present the basic material and to illustrate how the two traditional themes of model theory interact. These traditional themes are the investigation concrete mathematical structures and the sets definable in them and the investigation of sets of sentences (theories) and the general structure of their models. Ideally, the reader of this text should already have an acquaintance with first-order logic, be comfortable with basic set theory (Zorn’s lemma, cardinals, ordinals), and have had a year long course in algebra at the graduate level.

The text has eight chapters and two appendices, one on set theory and one on real algebra. Each chapter ends with a section of exercises and remarks. There are numerous exercises that vary in difficulty; some ask for proofs of results mentioned in the text; some work out examples that further illustrate material in the text; some introduce topics not appearing in the text (ultraproducts, for example); some require more outside knowledge and are marked with a dagger. The remarks contain some historical information. They also contain references to useful, mostly secondary, sources. The author also uses this opportunity to describe further results and suggest further reading. There is an extensive bibliography and a brief index.

This text is noteworthy for its wealth of examples and its desire to bring the student to the point where the frontiers of resrearch are visible. The author briefly indicates sections to comprise a one semester course, but there is no dependency graph for its sections. The text is packed and negotiating a path through it and its exercises may require careful thought. In any case this book should be on the shelf of anybody with an interest in model theory.

Here are the chapter headings and a partial indication of their contents. 1. Structures and Theories: first-order languages and -structures, theories and elementary classes, definable sets and interpretability; 2. Basic Techniques: compactness and Henkin constructions, complete theories, Löwenheim-Skolem theorems, back and forth constructions, ω 1 ,ω and Scott’s isomorphism theorem, Ehrenfeucht-Fraïssé games; 3. Algebraic Examples: quantifier elimination (QE), (ordered) divisible abelian groups, Presburger arithmetic, algebraically closed fields and the elimination of imaginaries, real closed fields; 4. Realizing and Omitting Types: types, omitting types and prime models, prime model extensions of ω-stable theories, saturated and homogeneous models, QE for differentially closed fields, Vaught’s two cardinal theorem, number of countable models, Morley’s analysis of countable models; 5. Indiscernibles: order indiscernibles, Ehrenfeucht-Mostowski models, a many-models theorem, an independence result for Peano arithmetic (Paris-Harrington); 6. ω-Stable Theories: uncountably categorical theories, the Baldwin-Lachlin proof of Morley’s categoricity theorem, Morley rank, forking and independence, uniqueness of prime model extensions, prime models of ω-stable theories; 7. ω-Stable Groups: chain conditions, generic types, indecomposibility theorem, definable groups in algebraically closed fields, algebraic and constructible groups, generically presented groups and Hrushovski’s theorem; 8. Geometry of Strongly Minimal sets: pregeometries, geometry of strongly minimal sets, Zariski geometries, applications to Diophantine geometry (a special case of Hrushovski’s proof of the Mordell-Lang Conjecture for function fields).


MSC:
03CxxModel theory
03-01Textbooks (mathematical logic)
03-02Research monographs (mathematical logic)