Reverse Mathematics 2001

Please note, due to essential maintenance online transactions will not be possible between 09:00 and 13:00 BST, on Monday 20th January 2020 (04:00-08:00 EDT). We apologise for any inconvenience.

- Online publication date: March 2017

- Publisher: Cambridge University Press
- DOI: https://doi.org/10.1017/9781316755846.021
- pp 331-348

[1] Effective coloration,The Journal of Symbolic Logic, vol. 41 (1976), pp. 469–480. ,

[2] On-line chain partitions of orders,Theoretical Computer Science, vol. 175 (1997), pp. 283–292. ,

[3] Reverse mathematics and recursive graph theory,Mathematical Logic Quarterly, vol. 44 (1998), pp. 465–473. and ,

[4] On-line and first-fit colorings of graphs,Journal of Graph Theory, vol. 12 (1988), pp. 217–227. and ,

[5] First-fit and on-line chromatic number of families of graphs,Ars Combinatoria, vol. 29C (1990), pp. 168–176. and ,

[6] Degrees of functions with no fixed points,Logic, methodology and philosophy of science, VIII (Moscow, 1987) ( , , and , editors), North-Holland, Amsterdam, 1989, pp. 191–201. , Jr.,

[7] An effective version of Dilworth's theorem,Transactions of the American Mathematical Society, vol. 268 (1981), pp. 63–77. ,

[8] Recursive and on-line graph coloring,Handbook of recursive mathematics, vol. 2, North-Holland, Amsterdam, 1988, pp. 1233–1269. ,

[9] Coloring graphs on-line,Online algorithms (Schloss Dagstuhl, 1996), Lecture Notes in Computer Science, vol. 1442, Springer, Berlin, 1998, pp. 281–305. ,

[10] On-line graph coloring and recursive graph theory,SIAMJournal on DiscreteMathematics, vol. 7 (1994), pp. 72–89. , , and ,

[11] First-fit and on-line coloring of graphs which do not induce P 5, SIAM Journal on Discrete Mathematics, vol. 8 (1995), pp. 485–498. ,

[12] An extremal problem in recursive combinatorics,Congressus Numerantium, vol. 33 (1981), pp. 143–153. and ,

[13] On the decomposition of graphs,Studia Scientiarum Mathematicarum Hungarica, vol. 1 (1966), pp. 237–238. ,

[14] Effective matchmaking (recursion theoretic aspects of a theorem of Philip Hall),Proceedings of the London Mathematical Society. Third Series, vol. 25 (1972), pp. 615–654. and ,

[15] Effective matchmaking and k-chromatic graphs, Proceedings of the American Mathematical Society, vol. 39 (1973), pp. 371–378. and ,

[16] Recursive colorings of graphs,Canadian Journal of Mathematics, vol. 32 (1980), pp. 821–830. ,

[17] Graph coloring and reverse mathematics,Mathematical Logic Quarterly, vol. 46 (2000), pp. 543–548. ,

[18] Subsystems of second order arithmetic, Perspectives inMathematical Logic, Springer-Verlag, 1998. ,