Logic Year 1979-80
The University of Connecticut, USA
Herausgegeben: Lerman, M.; Schmerl, J. H.; Soare, R. I.
PAYBACK Punkte
16 °P sammeln!
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 decis...
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.
Andere Kunden interessierten sich für
