EUVIMEDEUVIMED entdecken
Crossref

G abriele B uriola . Proof-Theoretical Aspects of Well Quasi-Orders and Phase Transitions in Arithmetical Provability . University of Trento and Ghent University, Double Degree. 2024. Supervised by Peter Schuster and Andreas Weiermann. MSC: 03B30, 03F30, 03F55. Keywords: well quasi-orders, reverse mathematics, ordinal analysis, constructive mathematics, phase transitions.

The Bulletin of Symbolic Logic · 2026-06 · 32 (2) · 356-357

DOI: 10.1017/bsl.2025.10108 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Bulletin of Symbolic Logic, online erschienen am 23.06.2026.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this thesis we study the concept of well quasi-order , originally developed in order theory but nowadays transversal to many areas, in the over-all context of proof theory—more precisely, in reverse mathematics and constructive mathematics. Reversed mathematics, proposed by Harvey Friedman, aims to classify the strength of mathematical theorems by identifying the required axioms. In this framework, we focus on two classical results relative to well quasi-orders: Kruskal’s theorem and Higman’s lemma. Concerning the former, we compute the proof-theoretic ordinals of two different versions establishing their non equivalence; both versions involve labelled trees: in one case with a bound on the branching degree (i.e., the number of children for each node), in the other without. Regarding the latter, we study, over the base theory RCA 0 $_{\boldsymbol {0}}$ Subscript bold 0 , the relations between Higman’s original achievements and some versions of Kruskal’s theorem. For what concerns constructive mathematics, which goes back to Brouwer’s reflections and rejects the law of excluded middle in favour of more perspicuous reasoning principles, we scrutinize the main definitions of well quasi-order establishing their constructive nature; moreover, a new constructive proof of Higman’s lemma is proposed paving the way for a systematic analysis of well quasi-orders within constructive means. On top of all this we consider a peculiar phenomenon in proof theory, namely phase transitions in provability. Building upon previous results about provability in Peano Arithmetic, we locate the threshold separating provability and unprovability for statements regarding Goodstein sequences, Hydra games, and Ackermannian functions. Abstract extracted from the PhD Thesis Gabriele Buriola University of Verona, Verona, Italy E-mail : gabriele.buriola@univr.it

Zitieren

APA

(2026). G abriele B uriola . Proof-Theoretical Aspects of Well Quasi-Orders and Phase Transitions in Arithmetical Provability . University of Trento and Ghent University, Double Degree. 2024. Supervised by Peter Schuster and Andreas Weiermann. MSC: 03B30, 03F30, 03F55. Keywords: well quasi-orders, reverse mathematics, ordinal analysis, constructive mathematics, phase transitions. The Bulletin of Symbolic Logic, 32(2), 356-357. https://doi.org/10.1017/bsl.2025.10108

Vancouver

G abriele B uriola . Proof-Theoretical Aspects of Well Quasi-Orders and Phase Transitions in Arithmetical Provability . University of Trento and Ghent University, Double Degree. 2024. Supervised by Peter Schuster and Andreas Weiermann. MSC: 03B30, 03F30, 03F55. Keywords: well quasi-orders, reverse mathematics, ordinal analysis, constructive mathematics, phase transitions. The Bulletin of Symbolic Logic. 2026;32(2):356-357. doi:10.1017/bsl.2025.10108

BibTeX
@article{euvimed2026,
  title = {G abriele B uriola . Proof-Theoretical Aspects of Well Quasi-Orders and Phase Transitions in Arithmetical Provability . University of Trento and Ghent University, Double Degree. 2024. Supervised by Peter Schuster and Andreas Weiermann. MSC: 03B30, 03F30, 03F55. Keywords: well quasi-orders, reverse mathematics, ordinal analysis, constructive mathematics, phase transitions},
  journal = {The Bulletin of Symbolic Logic},
  year = {2026},
  volume = {32},
  number = {2},
  pages = {356--357},
  doi = {10.1017/bsl.2025.10108}
}
Kostenlos starten →