Pages that link to "Item:Q5635436"

The following pages link to A classification of the ordinal recursive functions (Q5635436):

Displaying 33 items.

• The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete (Q344560) (← links)
• Proof lengths for instances of the Paris-Harrington principle (Q526964) (← links)
• Sharp thresholds for hypergraph regressive Ramsey numbers (Q618311) (← links)
• Mass problems associated with effectively closed sets (Q765664) (← links)
• Informal versus formal mathematics (Q885512) (← links)
• Inductive full satisfaction classes (Q920081) (← links)
• Classifying the phase transition threshold for Ackermannian functions (Q1012327) (← links)
• Ordinal recursive bounds for Higman's theorem (Q1129003) (← links)
• Complexity of algorithms and computations (Q1153141) (← links)
• Unprovable combinatorial statements (Q1201266) (← links)
• Increase of the complexity of functions by an application of multiple recursion (Q1245948) (← links)
• A solution to Kronecker's problem (Q1335137) (← links)
• Bootstrapping the primitive recursive functions by only 27 colors (Q1357751) (← links)
• Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
• Transfinite induction within Peano arithmetic (Q1919522) (← links)
• Proof theory and ordinal analysis (Q2276954) (← links)
• Slow reflection (Q2407272) (← links)
• Ackermann's substitution method (remixed) (Q2503393) (← links)
• Herbrand analyses (Q2641297) (← links)
• Complexity Hierarchies beyond Elementary (Q2828216) (← links)
• Mass Problems and Randomness (Q3370625) (← links)
• Classifying the Provably Total Functions of PA (Q3430936) (← links)
• A decidable subclass of the minimal Gödel class with identity (Q3695254) (← links)
• An Unprovable Ramsey-Type Theorem (Q4031465) (← links)
• P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property (Q4140975) (← links)
• A Model-Theoretic Approach to Ordinal Analysis (Q4338039) (← links)
• Ideal membership in polynomial rings over the integers (Q4461098) (← links)
• A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods (Q4750638) (← links)
• Minimal readability of intuitionistic arithmetic and elementary analysis (Q4876321) (← links)
• How to characterize provably total functions by local predicativity (Q4879900) (← links)
• (Q5101339) (← links)
• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy (Q5676207) (← links)
• Long finite sequences (Q5940305) (← links)