Refinement of Homogeneity and Ramsey numbers

키워드

참고문헌 (12)

1. L. Carlucci, "Sharp thresholds for hypergraph regressive Ramsey numbers", J. Combin. Theory Ser. A, 118(2), pp.558~585 (2011)[DOI]
2. D. Conlon, "Recent developments in graph Ramsey theory, in Surveys in combinatorics 2015;London Math. Soc. Lecture Note Ser., 424", pp.49~118 (2015), Cambridge Univ. Press
3. P. Erdos, "Some remarks on the theory of graphs", Bull. Amer. Math. Soc., 53, pp.292~294 (1947)[DOI]
4. P. Erdos, "Combinatorial set theory: partition relations for cardinals, Studies in Logic and the Foundations of Mathematics", pp.106~ (1984), North-Holland Publishing Co.
5. P. Erdos, "Combinatorial theorems on classifications of subsets of a given set", Proc. London Math. Soc. (3), (2), pp.417~439 (1952)
6. A. Freund, "Proof lengths for instances of the Paris-Harrington principle", Ann. Pure Appl. Logic, 168(7), pp.1361~1382 (2017)[DOI]
7. A. Kanamori, "On Godel incompleteness and finite combinatorics", Ann. Pure Appl. Logic, 33(1), pp.23~41 (1987)[DOI]
8. R. Kaye, "Models of Peano Arithmetic, Oxford Logic Guides", pp.15~ (1991), The Clarendon Press, Oxford University Press
9. G. Lee, "Phase Transitions in Axiomatic Thought", PhD, pp.2005
10. J. Paris, "Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics", pp.1133~1142 (1977), North-Holland
11. F. P. Ramsey, "On a Problem of Formal Logic", Proc. London Math. Soc. (2), 30(4), pp.264~286 (1929)
12. A. Weiermann, "A classification of rapidly growing Ramsey functions", Proc. Amer. Math. Soc., 132(2), pp.553~561 (2004)[DOI]

관련 논문AI추천