Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
From MaRDI portal
Publication:2566073
DOI10.1016/j.apal.2005.05.012zbMath1090.03028MaRDI QIDQ2566073
Publication date: 22 September 2005
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2005.05.012
survey; ordinal analysis; analytic combinatorics; Tauberian theory; proof-theoretic ordinals; logical limit laws; independence results for systems of arithmetic
03F30: First-order arithmetic and fragments
03E05: Other combinatorial set theory
03F15: Recursive ordinals and ordinal notations
Related Items
Phase transitions for Gödel incompleteness, Classifying the phase transition threshold for Ackermannian functions, A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\), Classifying the Provably Total Functions of PA, Phase Transitions for Weakly Increasing Sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Gödel incompleteness and finite combinatorics
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
- Une théorie combinatoire des séries formelles
- Proof-theoretic investigations on Kruskal's theorem
- Asymptotic results for partitions (I) and the distribution of certain integers
- Applications of cut-free infinitary derivations to generalized recursion theory
- Proof theory for theories of ordinals. I: Recursively Mahlo ordinals
- Dynamic ordinal analysis
- An ordinal analysis of stability
- Proof theory. An introduction
- Exact asymptotic formulas for the coefficients of nonmodular functions
- Provability algebras and proof-theoretic ordinals. I
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
- The number of trees
- Bounds for the closure ordinals of essentially monotonic increasing functions
- The number of primes in a short interval.
- Ordinal numbers and the Hilbert basis theorem
- GROWTH OF FINITELY GENERATED POLYNILPOTENT LIE ALGEBRAS AND GROUPS, GENERALIZED PARTITIONS, AND FUNCTIONS ANALYTIC IN THE UNIT CIRCLE
- Partition Functions Whose Logarithms are Slowly Oscillating
- Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1
- Cut elimination for impredicative infinitary systems. Part II ordinal analysis for iterated inductive definitions
- Π12-logic, Part 1: Dilators
- On Gaps Between Squarefree Numbers II
- Bounds for the closure ordinals of replete monotonic increasing functions
- Ordinals connected with formal theories for transfinitely iterated inductive definitions
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
- A Uniform Approach to Fundamental Sequences and Hierarchies
- A classification of rapidly growing Ramsey functions
- An application of graphical enumeration to PA *
- On the Contour of Random Trees
- A Tauberian Theorem of Exponential Type
- Extensions of arithmetic for proving termination of computations
- A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
- Tauberian Theory
- Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
- Worms, gaps, and hydras
- Weak Asymptotic Properties of Partitions
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Two applications of analytic functors
