Patterns of resemblance: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 1:
The patterns of resemblance (PoR) are a system of ordinal-notations introduced by T. J. Carlson. Like the notion of stability for ordinals it uses elementary substructures, however between ordinals themselves, instead of between ranks of the constructible universe. Carlson's \(<_n\)-relations have a property known as the respecting property, which also holds for the \(\Sigma_n\)-relations between ranks of \(L\), and for parenthood relations in [[Bashicu matrix system|BMS]]. For this reason, pure patterns of resemblance were originally believed to have the same limit of representable ordinals as BMS.
A pattern is known as isominimal if it is pointwise least among all patterns isomorphic to it. The ''core'' is the set of ordinals which occur in an isominimal pattern.<ref>T. J. Carlson, "[https://www.sciencedirect.com/science/article/pii/S0168007200000403 Elementary Patterns of Resemblance]" (2001). Annals of Pure and Applied Logic vol. 108, pp.19--77.</ref> The definition of the core depends on which system is used, and as there are different systems going by the name "patterns of resemblance" (such as pure second-order patterns and additive first-order patterns), the term "the core" is context-dependent, and is defined analogously.<ref name="PureSigma2Beyond">G. Wilken, "[https://arxiv.org/
A characterization of the core for additive second-order patterns is not currently known, but Wilken expects that it is equal to the proof-theoretic ordinal of KPI (axiomatization of "admissible limits of admissible universes").<ref>G. Wilken, [https://arxiv.org/abs/1608.08421v5 Pure patterns of order 2] (2017). Accessed 29 August 2023.</ref><sup>p.23</sup><ref name="PureSigma2Beyond" /><sup>p.6</sup> (Although the second source claims that this ordinal is obtained from collapsing \(\omega\)-many weakly inaccessible cardinals - check this)
|