Logic Year 1979-80

The University of Connecticut, USA
Herausgegeben:Lerman, M.; Schmerl, J. H.; Soare, R. I.

• Broschiertes Buch

Produktbeschreibung

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.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Mathematics 859
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-10708-8
• 1981
• Seitenzahl: 340
• Erscheinungstermin: 1. Mai 1981
• Englisch
• Abmessung: 235mm x 155mm x 19mm
• Gewicht: 544g
• ISBN-13: 9783540107088
• ISBN-10: 3540107088
• Artikelnr.: 23564426

Inhaltsangabe

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.