Logic Year 1979–80: The University of Connecticut, USA

Definability and the hierarchy of stable theories....Pages 1-15
QE rings in characteristic p....Pages 16-31
Hierarchies of sets and degrees below 0′....Pages 32-48
The plus-cupping theorem for the recursively enumerable degrees....Pages 49-62
Natural α-RE degrees....Pages 63-66
Elementary theory of automorphism groups of doubly homogeneous chains....Pages 67-82
Three easy constructions of recursively enumerable sets....Pages 83-91
On existence of Σ n end extensions....Pages 92-103
Model theoretic characterizations in generalized recursion theory....Pages 104-119
 $$L_{\infty _{\omega _1 } }$$ -Elementarily equivalent models of power ω 1 ....Pages 120-131
On recursive linear orderings....Pages 132-142
The complexity of types in field theory....Pages 143-156
The topos of types....Pages 157-201
Some decision problems for subtheories of two-dimensional partial orderings....Pages 202-214
Counter-examples via model completions....Pages 215-229
High recursively enumerable degrees and the anti-cupping property....Pages 230-245
On the Grilliot-Harrington-MacQueen theorem....Pages 246-267
Recursively saturated, rather classless models of peano arithmetic....Pages 268-282
The degrees of unsolvability: Global results....Pages 283-301
Two theorems on autostability in p-Groups....Pages 302-311
Constructive and recursive scattered order types....Pages 312-326