The paper shows Cameron's classification of strongly indivisible graphs is effective up to a change of computable presentation, partially holds in the omega-model REC, and requires the induction scheme I-Sigma-0-2 in Cameron's original proof.
On the uniform c omputational content of Ramsey’s Theorem,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Effectiveness and strong graph indivisibility
The paper shows Cameron's classification of strongly indivisible graphs is effective up to a change of computable presentation, partially holds in the omega-model REC, and requires the induction scheme I-Sigma-0-2 in Cameron's original proof.