Fast growing functions based on Ramsey theorems
From MaRDI portal
Publication:1191932
DOI10.1016/0012-365X(91)90346-4zbMath0758.03019OpenAlexW1968730206WikidataQ59409091 ScholiaQ59409091MaRDI QIDQ1191932
Bernd Voigt, W. Thumser, Hans Jürgen Prömel
Publication date: 27 September 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(91)90346-4
fast growing functionsRamsey theoremscolorings of pairsedge colorings of graphshierarchies of recursive functionsordinal recursion
Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies, Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers, Unnamed Item
Cites Work
- On Gödel incompleteness and finite combinatorics
- A short proof of the restricted Ramsey theorem for finite set systems
- Harvey Friedman's research on the foundations of mathematics
- Rapidly growing Ramsey functions
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Extension of an effectively generated class of functions by enumeration
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property
- Postscript to “built-up systems of fundamental sequences and hierarchies of number-theoretic functions”
- Systems of predicative analysis
- Systems of predicative analysis, II: Representations of ordinals
- Ramsey's theorem and recursion theory
- On n-quantifier induction
- A Combinatorial Theorem
- On the interpretation of non-finitist proofs–Part II
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
