Patterns of resemblance and Bachmann-Howard fixed points
From MaRDI portal
Abstract: Timothy Carlson's patterns of resemblance employ the notion of -elementarity to describe large computable ordinals. It has been conjectured that a relativization of these patterns to dilators leads to an equivalence with -comprehension (Question 27 of A. Montalb'an's "Open questions in reverse mathematics", Bull. Symb. Log. 17(3)2011, 431-454). In the present paper we prove this conjecture. The crucial direction (towards -comprehension) is reduced to a previous result of the author, which is concerned with relativizations of the Bachmann-Howard ordinal.
This page was built for publication: Patterns of resemblance and Bachmann-Howard fixed points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6356435)