Proof-theoretic strengths of the well ordering principles

2018/11/25 by Toshiyasu Arai, Arai, Toshiyasu · 1 citation
Computer Science · Mathematics · #03F35 #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Logic, programming, and type systems #Mathematical and Theoretical Analysis

paper · pdf · doi:10.48550/arxiv.1811.09964

openalex publication_date 2018/11/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this note the proof-theoretic ordinal of the well-ordering principle for the normal functions \sf g on ordinals is shown to be equal to the least fixed point of \sf g. Moreover corrections to the previous paper are made.

Cited by

• Ordinal Analysis of Well-Ordering Principles, Well Quasi-Orders Closure Properties, and Σ_n-Collection Schema

Related

• Derivatives of normal functions and omega-models
• Well ordering principles and Π¹₄-statements: a pilot study
• Well-Ordering Principles in Proof Theory and Reverse Mathematics
• Reductions of well-ordering principles to combinatorial theorems
• Normal functions and maximal order types