Publisher
Springer International Publishing
Reference12 articles.
1. Buchholz, W., Wainer, S.: Provably computable functions and the fast growing hierarchy. In: Logic and Combinatorics (Arcata, Calif., 1985), pp. 179–198. American Mathematical Society, Providence (1987)
2. Erdős, P., Rado, R.: A combinatorial theorem. J. Lond. Math. Soc. 25, 249–255 (1950)
3. Gödel, K.: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. Monatsh. Math. Phys. 38, 173–198 (1931)
4. Hardy, G.: A theorem concerning the infinite cardinal numbers. Quart J Math 35, 87–94 (1904)
5. Jech, T.: Set Theory. Pure and Applied Mathematics. Springer, Berlin (1978)