Bibliography

1

Ron Aharoni, Menachem Magidor, and Richard A. Shore.
On the strength of König's duality theorem for infinite bipartite graphs.
Journal of Combinatorial Theory, Series B, 54:257-290, 1992.

2

J. N. Crossley, J. B. Remmel, R. A. Shore, and M. E. Sweedler, editors.
Logical Methods. Birkhäuser, 1993.
813 pages.

3

Solomon Feferman.
Systems of predicative analysis, I.
Journal of Symbolic Logic, 29:1-30, 1964.

4

Solomon Feferman.
Systems of predicative analysis, II.
Journal of Symbolic Logic, 33:193-220, 1968.

5

Solomon Feferman.
Predicatively reducible systems of set theory.
In [16, part 2], pages 11-32, 1974.

6

Solomon Feferman.
A more perspicuous formal system for predicativity.
In [13, volume I], pages 68-93, 1978.

7

Solomon Feferman.
Reflecting on incompleteness.
Journal of Symbolic Logic, 56:1-49, 1991.

8

Solomon Feferman.
Does mathematics need new axioms?
American Mathematical Monthly, 106:99-111, 1999.

9

Harvey Friedman.
Systems of second order arithmetic with restricted induction, I, II (abstracts).
Journal of Symbolic Logic, 41:557-559, 1976.

10

Harvey Friedman, Kenneth McAloon, and Stephen G. Simpson.
A finite combinatorial principle which is equivalent to the 1-consistency of predicative analysis.
In [15], pages 197-230, 1982.

11

Harvey Friedman, Neil Robertson, and Paul Seymour.
The metamathematics of the graph minor theorem.
In [18], pages 229-261, 1987.

12

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.

13

K. Lorenz, editor.
Konstruktionen versus Positionen, Beiträge zur Diskussion um die Konstruktive Wissenschaftstheorie. Walter de Gruyter, Berlin, 1978.
volume I, XX + 350 pages, volume II, X + 406 pages.

14

Alberto Marcone.
Foundations of BQO theory.
Transactions of the American Mathematical Society, 345:641-660, 1994.

15

G. Metakides, editor.
Patras Logic Symposion, Studies in Logic and the Foundations of Mathematics. North-Holland, 1982.
IX + 391 pages.

16

D. S. Scott and T. J. Jech, editors.
Axiomatic Set Theory, volume XIII of Proceedings of Symposia in Pure Mathematics. American Mathematical Society, 1971-1974.
Part 1, VI + 474 pages, Part 2, VI + 222 pages.

17

Richard A. Shore.
On the strength of Fraïssé's conjecture.
In [2], pages 782-813, 1993.

18

S. G. Simpson, editor.
Logic and Combinatorics, Contemporary Mathematics. American Mathematical Society, 1987.
XI + 394 pages.

19

Stephen G. Simpson.
Set theoretic aspects of $\mathsf{ATR}_0$.
In [25], pages 255-271, 1982.

20

Stephen G. Simpson.
$\Sigma^1_1$ and $\Pi^1_1$ transfinite induction.
In [25], pages 239-253, 1982.

21

Stephen G. Simpson.
Nonprovability of certain combinatorial properties of finite trees.
In [12], pages 87-117, 1985.

22

Stephen G. Simpson.
Unprovable theorems and fast growing functions.
In [18], pages 359-394, 1987.

23

Stephen G. Simpson.
On the strength of König's duality theorem for countable bipartite graphs.
Journal of Symbolic Logic, 59:113-123, 1994.

24

Stephen G. Simpson.
Subsystems of Second Order Arithmetic.
Perspectives in Mathematical Logic. Springer-Verlag, 1999.
XIV + 445 pages.

25

D. van Dalen, D. Lascar, and T. J. Smiley, editors.
Logic Colloquium '80, Studies in Logic and the Foundations of Mathematics. North-Holland, 1982.
X + 342 pages.