This is a preview of subscription content, log in via an institution to check access.
References
Friedman, H.: Some systems of second order arithmetic and their use. In: James, R. (ed.) Proceedings of the International Congress of Mathematicians. (vol. 1, pp. 235–242) Vancouver: Canadian Mathematical Congress 1975
Friedman, H., McAloon, K., Simpson, S.: A finite combinatorial principle which is equivalent to the 1-consistency of predicative analysis. In: Metakides, G. (ed.) Patras logic symposium. Amsterdam New York: North-Holland 1982, pp. 197–230
Friedman, H., Simpson, S., Smith, R.: Countable algebra and set existence axioms. Ann. Pure Appl. Logic25, 141–181 (1983)
Hirst, J.: Combinatorics in subsystems of second order arithmetic. Ph.D. Thesis. The Pennsylvania State University 1987
Kierstead, H.: Recursive colorings of highly recursive graphs. Can. J. Math.33, 1291–1308 (1981)
Kirby, L., Paris, J.: Initial segments of models of Peano's axioms. In: Lachlan, A., Srebrny, M., Zarach, A. (eds.) Set theory and hierarchy theory V. (Lect. Notes Math., vol. 619, pp. 211–226) Berlin Heidelberg New York: Springer 1977
Kirby, L., Paris, J.:∑ n -collection schemas in arithmetic. In: MacIntyre, A., Pacholski, L., Pacholski, L., Paris, J. (eds.) Logic Colloquium '77. Amsterdam New York: North-Holland 1978, pp. 199–209
Manaster, A., Rosenstein, J.: Effective matchmaking andk-chromatic graphs. Proc. Am. Math. Soc.39, 371–378 (1973)
McAloon, K.: Completeness Theorems, incompleteness theorems, and models of arithmetic. Trans. Am. Math. Soc.239, 253–277 (1978)
McAloon, K.: Diagonal methods and strong cuts in models of arithmetic. In: MacIntyre, A., Pacholski, L., Paris, J. (eds.) Logic Colloquium '77. Amsterdam New York: North-Holland 1978, pp 171–181
Paris, J.: A hierarchy of cuts in models of arithmetic. In: Pacholski, L., Wierzejewski, J., Wilkie, A. (eds.) Models theory of algebra and arithmetic. (Lect. Notes Math., vol. 834, pp. 312–337) Berlin Heidelberg New York: Springer 1980
Schmerl, J.: Recursive colorings of graphs. Can. J. Math.32, 821–830 (1980)
Scott, D.: Algebras of sets binumerable in complete extensions of arithmetic. Proc. Symp. Pure Math.5, 117–121 (1962)
Shoenfield, J.: Degrees of models. J. Symb. Logic25, 233–237 (1960)
Simpson, S.: Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations? J. Symb. Logic49, 783–802 (1984)
Simpson, S.: Subsystems ofZ 2 and reverse mathematics. In: Takeuti, G. (ed.) Proof theory. Amsterdam New York: North-Holland 1985
Simpson, S.: Ordinal numbers and the Hilbert basis theorem. J. Symb. Logic53, 961–974 (1988)
Simpson, S.: Subsystems of second order arithmetic (in preparation)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hirst, J.L. Connected components of graphs and reverse mathematics. Arch Math Logic 31, 183–192 (1992). https://doi.org/10.1007/BF01269946
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01269946