 |
Discrete Mathematics & Theoretical Computer Science |
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.2771Phase transitions in Proof TheoryArticle
Authors: Lev Gordeev 1,2; Andreas Weiermann 
3,4
- 1 Eberhard Karls Universität Tübingen = Eberhard Karls University of Tuebingen
- 2 Eberhard Karls Universität Tübingen = University of Tübingen
- 3 Universiteit Gent = Ghent University [UGENT]
- 4 Universiteit Gent = Ghent University = Université de Gand [UGENT]
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.
Source: HAL:hal-01185569v1
Volume: DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
Section: Proceedings
Published on: January 1, 2010
Imported on: January 31, 2017
Keywords: phase transitions,proof theory,reverse mathematics,asymptotics,analytic combinatorics,well partial orderings,Higman-Kruskal-Friedman theorems,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]
1 Document citing this article
Consultation statistics
This page has been seen 300 times.
This article's PDF has been downloaded 550 times.