Logic Year 1979-80
The University of Connecticut, USA
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
42.75 €
Produktdetails
Produktinformationen zu „Logic Year 1979-80 “
Klappentext zu „Logic Year 1979-80 “
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.
Inhaltsverzeichnis zu „Logic Year 1979-80 “
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.
Bibliographische Angaben
- 1981, 340 Seiten, Maße: 15,5 x 23,5 cm, Taschenbuch, Englisch
- Herausgegeben: M. Lerman, R. I. Soare, J. H. Schmerl
- Verlag: Springer Berlin Heidelberg
- ISBN-10: 3540107088
- ISBN-13: 9783540107088
- Erscheinungsdatum: 01.05.1981
Sprache:
Englisch
Kommentar zu "Logic Year 1979-80"
0 Gebrauchte Artikel zu „Logic Year 1979-80“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Logic Year 1979-80".
Kommentar verfassen