Premium
Large Finite Sets
Author(s) -
Jervell Herman Ruge
Publication year - 1985
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19850313502
Subject(s) - citation , informatics , computer science , library science , law , political science
The more complicated notation we have for K t,he more complicated will the a-large sets be. KETOSEN developed his theory in RETONEN and SOLOVAY [3]. The theory there was used to give a generalization of RAMSEY’S theorem. They gave a combinatorial proof of the Paris-Harrington result (PARIS and HARRINGTON [S]). The a-large sets were used to give bounds in the following direction : any generalized Ramsey-function grows less fast than some n-recursive function where a < c 0 .