This book contains the material for a first course in pure model theory with applications to differentially closed fields.

Our ultimate purpose is to give an axiomatic treatment of recursion theory sufficient to develop the priority method. The direct or abstract approach is to keep in mind as clearly as possible the methods actually used in recursion theory, and then to formulate them explicitly. The indirect or experimental approach is to look first for other mathematical theories which seem similar to recursion theory, to formulate the analogies precisely, and then to search for an axiomatic treatment which covers not only (...) recursion theory but also the analogous theories as particular cases.The first approach is more general because it does not depend on the existence of analogues. A concrete mathematical theory, it seems, need have no such analogues and still be important, as e.g. classical number theory. In such a case, an axiomatic treatment may still be useful for exhibiting the mathematical structure of the theory considered and the assumptions on which it rests. However, it will lack one of the most heavily advertised advantages of the axiomatic method, namely, the “economy of thought” which results from an uniform theory for several different and interesting cases: we cannot hope for this if, by hypothesis, we know of only one particular case. In contrast, the second approach, if successful at all, is bound to achieve such “economy” because we start out with several interesting particular cases. Another possible virtue of the second approach is that of field work over insight: the abstract pattern that we are looking for and hoping to formalize in axioms, may not be evident in any one mathematical theory, but may spring to the eye if one happens to look simultaneously at several theories which happen to realize the pattern. (shrink)

This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.

The notion of a weakly scattered theory T is defined. T need not be scattered. For each a model of T, let sr() be the Scott rank of . Assume sr() ≤ ω\sp A \sb 1 for all a model of T. Let σ\sp T \sb 2 be the least Σ₂ admissible ordinal relative to T. If T admits effective k-splitting as defined in this paper, then θσ\cal Aθ\cal A$ a model of T.

There exists a countable structure of Scott rank where and where the -theory of is not ω-categorical. The Scott rank of a model is the least ordinal β where the model is prime in its -theory. Most well-known models with unbounded atoms below also realize a non-principal -type; such a model that preserves the Σ1-admissibility of will have Scott rank . Makkai [M. Makkai, An example concerning Scott heights, J. Symbolic Logic 46 301–318. [4]] produces a hyperarithmetical model of Scott (...) rank whose -theory is ω-categorical. A computable variant of Makkai’s example is produced in [W. Calvert, S.S. Goncharov, J.F. Knight, J. Millar, Categoricity of computable infinitary theories, Arch. Math. Logic . [1]; J. Knight, J. Millar, Computable structures of rank J. Math. Logic . [2]]. (shrink)

GENERALIZED RECUBION THEORY II © North-Holland Publishing Company (1978) MONOTONE QUANTIFIERS AND ADMISSIBLE SETS Ion Barwise University of Wisconsin ...

, a notion of forcing over E, the E-closure of L, is said to be effective if every sideways -generic extension preserves E-closure. There are set notions of forcing in E that do not preserve E-closure. The main theorem below asserts that is effective if and only if it is locally proper, a weak variant of Shelah's notion of proper.

Contents: Recursive Enumerability and the Jump Operator; On the Degrees Less Than 0'; A Simple Set Which Is Not Effectively Simple; The Recursively Enumerable Degrees Are Dense; Metarecursive Sets (with G Kreisel); Post's Problem, Admissible Ordinals and Regularity; On a Theorem of Lachlan and Marlin; A Minimal Hyperdegree (with R O Gandy); Measure-Theoretic Uniformity in Recursion Theory and Set Theory; Forcing with Perfect Closed Sets; Recursion in Objects of Finite Type; The a-Finite Injury Method (with S G Simpson); Remarks Against (...) Foundational Activity; Countable Admissible Ordinals and Hyperdegrees; The 1-Section of a Type n Object; The k-Section of a Type n Object; Post's Problem, Absoluteness and Recursion in Finite Types; Effective Bounds on Morley Rank; On the Number of Countable Models; Post's Problem in E-Recursion; The Limits of E-Recursive Enumerability; Effective Versus Proper Forcing. (shrink)