Logic Year 1979-80 The University of Connecticut, USA

Bibliographic Details
Other Authors: Lerman, M. (Editor), Schmerl, J.H. (Editor), Soare, R.I. (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1981, 1981
Edition:1st ed. 1981
Series:Lecture Notes in Mathematics
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • Definability and the hierarchy of stable theories
  • QE rings in characteristic p
  • Hierarchies of sets and degrees below 0?
  • The plus-cupping theorem for the recursively enumerable degrees
  • Natural ?-RE degrees
  • Elementary theory of automorphism groups of doubly homogeneous chains
  • Three easy constructions of recursively enumerable sets
  • On existence of ?n end extensions
  • Model theoretic characterizations in generalized recursion theory
  • -Elementarily equivalent models of power ?1
  • On recursive linear orderings
  • The complexity of types in field theory
  • The topos of types
  • Some decision problems for subtheories of two-dimensional partial orderings
  • Counter-examples via model completions
  • High recursively enumerable degrees and the anti-cupping property
  • On the Grilliot-Harrington-MacQueen theorem
  • Recursively saturated, rather classless models of peano arithmetic
  • The degrees of unsolvability: Global results
  • Two theorems on autostability in p-Groups
  • Constructive and recursive scattered order types