Proof-theoretic strengths of the well-ordering principles

DOI10.1007/s00153-019-00689-4zbMath1481.03063arXiv1811.09964OpenAlexW2966510993MaRDI QIDQ2309489

Toshiyasu Arai

Publication date: 1 April 2020

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.09964

zbMATH Keywords

proof-theoretic strengthwell-ordering principles\(\omega\)-models

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)

Cites Work

• Reverse mathematics and well-ordering principles: a pilot study
• Proof theory. 2nd ed
• Some results on cut-elimination, provable well-orderings, induction and reflection
• Derivatives of normal functions and \(\omega \)-models
• The Veblen functions for computability theorists
• A Remark on Gentzen's paper “Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten induktionin der reinen zahlentheorie”, I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proof-theoretic strengths of the well-ordering principles