Skip to Main content Skip to Navigation
Conference papers

Phase transitions in Proof Theory

Abstract : 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.
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-01185569
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 20, 2015 - 4:32:14 PM
Last modification on : Wednesday, November 3, 2021 - 2:56:50 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:58:04 AM

File

dmAM0124.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Lev Gordeev, Andreas Weiermann. Phase transitions in Proof Theory. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.343-358, ⟨10.46298/dmtcs.2771⟩. ⟨hal-01185569⟩

Share

Metrics

Record views

55

Files downloads

469