scientific article; zbMATH DE number 17786

zbMATH Open0735.03017MaRDI QIDQ3975129FDOQ3975129

Authors: Martin Loebl, J. Nešetřil 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• Slow versus fast growing
• scientific article; zbMATH DE number 1215495
• Sometimes slow growing is fast growing
• scientific article; zbMATH DE number 4055605
• Publication:4934570

zbMATH Keywords

surveyPeano arithmeticprimitive recursive functionsprovably total functionshierarchies of fast growing functions

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20)

Cited In (11)

• A classification of rapidly growing Ramsey functions
• Title not available (Why is that?)
• Provable (and unprovable) computability
• Title not available (Why is that?)
• A fast-growing sequence inspired by \(\mathrm{TREE}(k)\)
• A slow growing analogue to Buchholz' proof
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unprovable combinatorial statements
• Complexity hierarchies beyond elementary
• Fast growing functions based on Ramsey theorems

This page was built for publication:

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