Bootstrapping the primitive recursive functions by only 27 colors

DOI10.1016/S0012-365X(97)87041-0MaRDI QIDQ1357751zbMATH OpenOpenAlexFDO

Authors Søren Riis

Publication date 16 June 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(97)87041-0

zbMATH Keywords

coloringprimitive recursive functionfinitary version of Ramsey's Theorem

Mathematics Subject Classification ID

Ramsey theory (05D10) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Some bounds for the Ramsey-Paris-Harrington numbers
• A classification of rapidly growing Ramsey functions
• On Gödel incompleteness and finite combinatorics
• An Unprovable Ramsey-Type Theorem
• Effective versions of Ramsey's Theorem: Avoiding the cone above 0′

Cites work

• A classification of the ordinal recursive functions
• Rapidly growing Ramsey functions

Cited in

(4)

• A classification of rapidly growing Ramsey functions
• Note on finitary Hindman numbers
• Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension
• Fast growing functions based on Ramsey theorems

This page was built for publication: Bootstrapping the primitive recursive functions by only 27 colors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357751)