activity
20142021
most citedWell ordering principles for iterated -comprehension

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing math.LOShow all

6 papers · 1 filter

math.LO20211 cited

Well ordering principles for iterated -comprehension

Anton Freund, Michael Rathjen

We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated -compre…

math.LO2016

Classifying the provably total set functions of KP and KP(P)

Jacob Cook, Michael Rathjen

This article is concerned with classifying the provably total set-functions of Kripke-Platek set theory, KP, and Power Kripke-Platek set theory, KP(P), as well as proving several (…

math.LO2014

An order-theoretic characterization of the Howard-Bachmann-hierarchy

Jeroen Van der Meeren, Michael Rathjen, Andreas Weiermann

In this article we provide an intrinsic characterization of the famous Howard-Bachmann ordinal in terms of a natural well-partial-ordering by showing that this ordinal can be reali…

math.LO2014

Well ordering principles and bar induction

Michael Rathjen, Pedro Francisco Valencia Vizcaino

In this paper we show that the existence of omega-models of bar induction is equivalent to the principle saying that applying the Howard-Bachmann operation to any well-ordering yie…

math.LO2014

Goodstein revisited

Michael Rathjen

Inspired by Gentzen's 1936 consistency proof, Goodstein found a close fit between descending sequences of ordinals epsilon_0 and sequences of integers, now known as Goodstein seque…

math.LO2014

Indefiniteness in semi-intuitionistic set theories: On a conjecture of Feferman

Michael Rathjen

The paper proves a conjecture of Solomon Feferman concerning the indefiniteness of the continuum hypothesis relative to a semi-intuitionistic set theory.