Iterating the recursively Mahlo operations

MaRDI QIDQ4630793zbMATH OpenFDO

Authors Toshiyasu Arai

Publication date 23 April 2019

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

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15) Second- and higher-order arithmetic and fragments (03F35)

Abstract: In this paper we address a problem: How far can we iterate lower recursively Mahlo operations in higher reflecting universes? Or formally: How much can lower recursively Mahlo operations be iterated in set theories for higher reflecting universes? It turns out that in $P{i}_N$-reflecting universes the lowest recursively Mahlo operation can be iterated along towers of $Sigm{a}_1$-exponential orderings of height $N-3$, and that all we can do is such iterations. Namely the set theory for $P{i}_N$-reflecting universes is proof-theoretically reducible to iterations of the operation along such a tower.

Recommendations

• scientific article; zbMATH DE number 2069404
• scientific article; zbMATH DE number 2152230
• Generalizing the Mahlo hierarchy, with applications to the Mitchell models
• Proof theory for theories of ordinals. I: Recursively Mahlo ordinals
• A Theory of Operations on the Universe I. The Theory of Iteration and F‐Ordinals

Cited in

(5)

• scientific article; zbMATH DE number 2069404 (Why is no real title available?)
• The Recursively Mahlo Property in Second Order Arithmetic
• RECURSIVE AND ITERATIVE OWA OPERATORS
• A simplified ordinal analysis of first-order reflection
• Wellfoundedness proofs by means of non-monotonic inductive definitions. II: First order operators

This page was built for publication: Iterating the recursively Mahlo operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630793)