Lev Gordeev ; Andreas Weiermann
-
Phase transitions in Proof Theory
dmtcs:2771 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2010,
DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
-
https://doi.org/10.46298/dmtcs.2771
Phase transitions in Proof Theory
Authors: Lev Gordeev 1; Andreas Weiermann 2
NULL##NULL
Lev Gordeev;Andreas Weiermann
1 Eberhard Karls Universität Tübingen = Eberhard Karls University of Tuebingen
2 Universiteit Gent = Ghent University
Using standard methods of analytic combinatorics we elaborate critical points (thresholds) of phase transitions from provability to unprovability of arithmetical well-partial-ordering assertions in several familiar theories occurring in the reverse mathematics program.
Volume: DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)