Iterating the recursively Mahlo operations

Details Iterating the recursively Mahlo operations Iterating the recursively Mahlo operations

2010-05-12

arxiv.org/abs/1005.1987v1

Proceedings of the thirteenth International Congress of Logic Methodology, Philosophy of Science, 2009

Mathematics

Logic

Scientific paper

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 $\Pi_N$-reflecting universes the lowest recursively Mahlo operation can be iterated along towers of $\Sigma_1$-exponential orderings of height $N-3$, and that all we can do is such iterations. Namely the set theory for $\Pi_N$-reflecting universes is proof-theoretically reducible to iterations of the operation along such a tower.

Affiliated with

Also associated with

No associations

Rating

Iterating the recursively Mahlo operations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Iterating the recursively Mahlo operations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Iterating the recursively Mahlo operations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-498923