1

Lattice Embeddings in the αr.e
– N Greenberg

2

Maximal αr.e. sets
– M Lerman

2

Some Minimal Pairs of αRecursively Enumerable Degrees
– M Lerman, G E Sacks

6

1989], Finite injury and Σ1induction
– M E Mytilinaios

3

Trace Constructions in αRecursion Theory
– D Odell

7

On the Theory of the PTIME Degrees of the Recursive Sets
– J Shinoda, T A Slaman

2

Σ1Collection and the Finite Injury Priority Method
– T A Slaman, W H Woodin
 1987

10

ConsistencyProof for the Generalized ContinuumHypothsis
– K F Gödel

16

The Undecidability of the Recursively Enumerable Degrees
– L Harrington, S Shelah

1

Lower Bounds for Pairs of Metarecursively Enumerable Degrees
– J Sukonick

4

Formalization of the Theory of Ordinal Numbers
– G Takeuti

4

Transfinite Recursion on Admissible Ordinals
– S Kripke

1

The Constructive Second Number Calss
– A Church

4

Techniques of Admissible Recursion Theory
– C T Chong

1

The Irregular and NonHyperregular αr.e
– R A Shore
 1975

1

Totally < ω ω computably enumerable degrees and bounding M5’, in preparation
– R G Downey, N Greenberg

1

Lattices of αrecursively enumerable sets, in Generalized Recursion Theory
– M Lerman
 1978

3

Splitting an α recursively enumerable set
– R A Shore
 1975

5

On the recursive functions of ordinal numbers
– G Takeuti
 1960
