Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Phase transitions in ...
Conference paper

Phase transitions in Proof Theory

Lev Gordeev (1) (2), Andreas Weiermann ORCID (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
(4) Universiteit Gent = Ghent University = Université de Gand
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2009
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
Proceedings
DOI
10.46298/dmtcs.2771
License
https://about.hal.science/hal-authorisation-v1
Indicators
724
Views
1152
Downloads

Phase transitions in Proof Theory

Lev Gordeev (1) (2), Andreas Weiermann ORCID (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
(4) Universiteit Gent = Ghent University = Université de Gand
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.
Keywords
  • [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]
  • phase transitions
  • proof theory
  • reverse mathematics
  • asymptotics
  • analytic combinatorics
  • well partial orderings
  • Higman-Kruskal-Friedman theorems
Cited by

Source: OpenCitations

  • Phase transitions of iterated Higman-style well-partial-orderings

    Archive for Mathematical Logic

    Authors : Lev Gordeev, Andreas Weiermann ORCID

    Journal reference : Volume 51, 2011, pp. 127-161

    DOI : 10.1007/s00153-011-0258-3
Preview
Loading PDF preview...