Patterns of Projecta
Krawczyk, Adam
J. Symbolic Logic, Tome 46 (1981) no. 1, p. 287-295 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Roughly speaking, a pattern is a finite sequence coding the set of natural numbers $n$ for which the $\Sigma_{n + 1}$ projectum is less than the $\Sigma_n$ projectum for a given admissible ordinal. We prove that for each pattern there exists an ordinal realizing it. Several results on the orderings of patterns are given. We conclude the paper with remarks on $\triangle_n$ projecta. The main technique, used throughout the paper, is Jensen's Uniformisation Theorem.
Publié le : 1981-06-14
Classification:  
@article{1183740776,
     author = {Krawczyk, Adam},
     title = {Patterns of Projecta},
     journal = {J. Symbolic Logic},
     volume = {46},
     number = {1},
     year = {1981},
     pages = { 287-295},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183740776}
}

Krawczyk, Adam. Patterns of Projecta. J. Symbolic Logic, Tome 46 (1981) no. 1, pp.  287-295. http://gdmltest.u-ga.fr/item/1183740776/