Phase transitions in Proof Theory - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2010

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.
Fichier principal
Vignette du fichier
dmAM0124.pdf (397.07 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01185569 , version 1 (20-08-2015)

Identifiers

Cite

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⟩

Collections

TDS-MACS
60 View
701 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More