Patterns of resemblance: Difference between revisions
No edit summary |
|||
| Line 1: | 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 version 4]]. For this reason, pure patterns of resemblance were originally believed to have the same limit of representable ordinals as BMS. |
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 version 4]]. 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 name="ElementaryPatterns">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/abs/1710.01870v5 Pure \(\Sigma_2\)-Elementarity beyond the Core]" (2021), p.6. Accessed 29 August 2023.</ref> For all systems currently analyzed, the core is a recursive ordinal.<ref>T. J. Carlson, "[https://www.researchgate.net/publication/257334588_Ordinal_arithmetic_and_Sigma_1-elementarity Ordinal Arithmetic and \(\Sigma_1\)-Elementarity]" (1997), implicit in section 3. Accessed 29 August 2023.</ref><ref>T. J. Carlson, "Elementary patterns of resemblance", corollary 6.12. Annals of Pure and Applied Logic vol. 108 (2001), pp.19--77.</ref><ref>G. Wilken, "[ Pure patterns of order 2]", corollary 4.10. Annals of Pure and Applied Logic vol. 169 (2018), pp.54--82.</ref><ref>T. J. Carlson, "Patterns of resemblance of order two", corollary 15.15. Annals of Pure and Applied Logic vol. 158 (2009), pp.90--124.</ref> |
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 name="ElementaryPatterns">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/abs/1710.01870v5 Pure \(\Sigma_2\)-Elementarity beyond the Core]" (2021), p.6. Accessed 29 August 2023.</ref> For all systems currently analyzed, the core is a recursive ordinal.<ref>T. J. Carlson, "[https://www.researchgate.net/publication/257334588_Ordinal_arithmetic_and_Sigma_1-elementarity Ordinal Arithmetic and \(\Sigma_1\)-Elementarity]" (1997), implicit in section 3. Accessed 29 August 2023.</ref><ref>T. J. Carlson, "Elementary patterns of resemblance", corollary 6.12. Annals of Pure and Applied Logic vol. 108 (2001), pp.19--77.</ref><ref name="PurePatternsOrderTwo">G. Wilken, "[https://arxiv.org/abs/1608.08421v5 Pure patterns of order 2]", corollary 4.10. Annals of Pure and Applied Logic vol. 169 (2018), pp.54--82.</ref><ref>T. J. Carlson, "Patterns of resemblance of order two", corollary 15.15. Annals of Pure and Applied Logic vol. 158 (2009), pp.90--124.</ref> |
||
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 |
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 name="PurePatternsOrderTwo" /><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) |
||
==Stability== |
==Stability== |
||
Revision as of 06:02, 31 August 2023
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 BMS version 4. 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.[1] 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.[2] For all systems currently analyzed, the core is a recursive ordinal.[3][4][5][6]
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").[5]p.23[2]p.6 (Although the second source claims that this ordinal is obtained from collapsing \(\omega\)-many weakly inaccessible cardinals - check this)
Stability
It has been known since (Carlson 2001) that certain variants of patterns of resemblance involving stability result in a core isomorphic to that of the usual patterns of resemblance. In particular, if \(\alpha\preceq\beta\) is interpreted as \(L_\alpha\prec_{\Sigma_1}L_\beta\), then the core of \((\textrm{Ord},0,+,\leq,\preceq)\) is isomorphic to the core of additive first-order patterns,[1]p.20 so it has order type \(\psi_0(\Omega_\omega)\). This may be seen as somewhat similar to the connection between BMS and stability used in Yto's termination proof for BMS.
- ↑ 1.0 1.1 T. J. Carlson, "Elementary Patterns of Resemblance" (2001). Annals of Pure and Applied Logic vol. 108, pp.19--77.
- ↑ 2.0 2.1 G. Wilken, "Pure \(\Sigma_2\)-Elementarity beyond the Core" (2021), p.6. Accessed 29 August 2023.
- ↑ T. J. Carlson, "Ordinal Arithmetic and \(\Sigma_1\)-Elementarity" (1997), implicit in section 3. Accessed 29 August 2023.
- ↑ T. J. Carlson, "Elementary patterns of resemblance", corollary 6.12. Annals of Pure and Applied Logic vol. 108 (2001), pp.19--77.
- ↑ 5.0 5.1 G. Wilken, "Pure patterns of order 2", corollary 4.10. Annals of Pure and Applied Logic vol. 169 (2018), pp.54--82.
- ↑ T. J. Carlson, "Patterns of resemblance of order two", corollary 15.15. Annals of Pure and Applied Logic vol. 158 (2009), pp.90--124.