E-Books durchsuchen
Logic Year 1979–80 [1981]
- 1
-
Definability and the hierarchy of stable theories
- 16
-
QE rings in characteristic p
- 32
-
Hierarchies of sets and degrees below 0′
- 49
-
The plus-cupping theorem for the recursively enumerable degrees
- 63
-
Natural α-RE degrees
- 67
-
Elementary theory of automorphism groups of doubly homogeneous chains
- 83
-
Three easy constructions of recursively enumerable sets
- 92
-
On existence of Σ<Subscript>n</Subscript> end extensions
- 104
-
Model theoretic characterizations in generalized recursion theory
- 120
-
<InlineEquation ID="IE1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="304_3-540-10708-8_Chapter_10_TeX2GIFIE1.gif" Format="GIF" Rendition="HTML" Type="Linedraw" /> </InlineMediaObject><EquationSource Format="TEX">$$L_{\infty _{\omega _1 } }$$</EquationSource> </InlineEquation>-Elementarily equivalent models of power ω<Subscript>1</Subscript>
- 132
-
On recursive linear orderings
- 143
-
The complexity of types in field theory
- 157
-
The topos of types
- 202
-
Some decision problems for subtheories of two-dimensional partial orderings
- 215
-
Counter-examples via model completions
- 230
-
High recursively enumerable degrees and the anti-cupping property
- 246
-
On the Grilliot-Harrington-MacQueen theorem
- 268
-
Recursively saturated, rather classless models of peano arithmetic
- 283
-
The degrees of unsolvability: Global results
- 302
-
Two theorems on autostability in p-Groups
- 312
-
Constructive and recursive scattered order types
