**1**-
K. Ambos-Spies, G. H. Müller, and G. E. Sacks, editors.
*Recursion Theory Week*, number 1432 in Lecture Notes in Mathematics. Springer-Verlag, 1990.

IX + 393 pages. **2**-
Errett Bishop and Douglas Bridges.
*Constructive Analysis*.

Number 279 in Grundlehren der mathematischen Wißenschaften. Springer-Verlag, 1985.

XII + 477 pages. **3**-
Andreas R. Blass, Jeffry L. Hirst, and Stephen G. Simpson.

Logical analysis of some theorems of combinatorics and topological dynamics.

In [27], pages 125-156, 1987. **4**-
Douglas K. Brown, Mariagnese Giusto, and Stephen G. Simpson.

Vitali's theorem and WWKL.*Archive for Mathematical Logic*, 1999.

18 pages, accepted April 1998, to appear. **5**-
Douglas K. Brown and Stephen G. Simpson.

The Baire category theorem in weak subsystems of second order arithmetic.*Journal of Symbolic Logic*, 58:557-578, 1993. **6**-
Timothy J. Carlson and Stephen G. Simpson.

A dual form of Ramsey's theorem.*Advances in Mathematics*, 53:265-290, 1984. **7**-
Peter Cholak, Carl G. Jockusch, Jr., and Theodore A. Slaman.

On the strength of Ramsey's theorem for pairs.*Journal of Symbolic Logic*, 1999.

71 pages, to appear. **8**-
S. B. Cooper, T. A. Slaman, and S. S. Wainer, editors.
*Computability, Enumerability, Unsolvability: Directions in Recursion Theory*, number 224 in London Mathematical Society Lecture Note Series. Cambridge University Press, 1996.

VII + 347 pages. **9**-
J. N. Crossley, J. B. Remmel, R. A. Shore, and M. E. Sweedler, editors.
*Logical Methods*. Birkhäuser, 1993.

813 pages. **10**-
H.-D. Ebbinghaus, G.H. Müller, and G.E. Sacks, editors.
*Recursion Theory Week*, number 1141 in Lecture Notes in Mathematics. Springer-Verlag, 1985.

IX + 418 pages. **11**-
Mariagnese Giusto and Stephen G. Simpson.

Located sets and reverse mathematics.*Journal of Symbolic Logic*, 1999.

37 pages, accepted August 1998, to appear. **12**-
Ronald L. Graham, Bruce L. Rothschild, and Joel H. Spencer.
*Ramsey Theory*.

Wiley, New York, 2nd edition, 1990.

XI + 196 pages. **13**-
L. A. Harrington, M. Morley, A. Scedrov, and S. G. Simpson, editors.
*Harvey Friedman's Research on the Foundations of Mathematics*, Studies in Logic and the Foundations of Mathematics. North-Holland, 1985.

XVI + 408 pages. **14**-
Kostas Hatzikiriakou.

Algebraic disguises of induction.*Archive for Mathematical Logic*, 29:47-51, 1989. **15**-
W. Hodges, M. Hyland, C. Steinhorn, and J. Truss, editors.
*Logic: From Foundations to Applications, Keele 1993*, Oxford Science Publications. Oxford University Press, 1996.

XIII + 536 pages. **16**-
A. James Humphreys and Stephen G. Simpson.

Separable Banach space theory needs strong set existence axioms.*Transactions of the American Mathematical Society*, 348:4231-4255, 1996. **17**-
Igor Kriz.

Well-quasiordering finite trees with gap-condition.*Annals of Mathematics*, 130:215-226, 1989. **18**-
Antonín Kucera.

Measure, classes and complete extensions of PA.

In [10], pages 245-259, 1985. **19**-
Antonín Kucera.

Randomness and generalizations of fixed point free functions.

In [1], pages 245-254, 1990. **20**-
Antonín Kucera.

On relative randomness.*Annals of Pure and Applied Logic*, 63:61-67, 1993. **21**-
Masahiro Kumabe.

A fixed point free minimal degree.

Preprint, 48 pages, 1997. **22**-
Richard Mansfield and Galen Weitkamp.
*Recursive Aspects of Descriptive Set Theory*.

Oxford Logic Guides. Oxford University Press, 1985.

VI + 144 pages. **23**-
Alberto Marcone.

On the logical strength of Nash-Williams' theorem on transfinite sequences.

In [15], pages 327-351, 1996. **24**-
Michael E. Mytilinaios and Theodore A. Slaman.

On a question of Brown and Simpson.

In [8], pages 205-218, 1996. **25**-
Marian B. Pour-El and J. Ian Richards.
*Computability in Analysis and Physics*.

Perspectives in Mathematical Logic. Springer-Verlag, 1988.

XI + 206 pages. **26**-
Richard A. Shore.

On the strength of Fraïssé's conjecture.

In [9], pages 782-813, 1993. **27**-
S. G. Simpson, editor.
*Logic and Combinatorics*, Contemporary Mathematics. American Mathematical Society, 1987.

XI + 394 pages. **28**-
Stephen G. Simpson.

BQO theory and Fraïssé's conjecture.

In [22], pages 124-138, 1985. **29**-
Stephen G. Simpson.

Nonprovability of certain combinatorial properties of finite trees.

In [13], pages 87-117, 1985. **30**-
Stephen G. Simpson.

Recursion-theoretic aspects of the dual Ramsey theorem.

In [10], pages 356-371, 1986. **31**-
Stephen G. Simpson.

Partial realizations of Hilbert's program.*Journal of Symbolic Logic*, 53:349-363, 1988. **32**-
Stephen G. Simpson.
*Subsystems of Second Order Arithmetic*.

Perspectives in Mathematical Logic. Springer-Verlag, 1999.

XIV + 445 pages. **33**-
Stephen G. Simpson and Rick L. Smith.

Factorization of polynomials and induction.*Annals of Pure and Applied Logic*, 31:289-306, 1986. **34**-
Theodore A. Slaman.

A note on the dual Ramsey theorem.

4 pages, unpublished, January 1997. **35**-
Fons van Engelen, Arnold W. Miller, and John Steel.

Rigid Borel sets and better quasi-order theory.

In [27], pages 199-222, 1987.