Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-28T15:27:41.735Z Has data issue: false hasContentIssue false
  • English
  • Français

Patterns of projecta1

Published online by Cambridge University Press:  12 March 2014

Adam Krawczyk
Adam Krawczyk*
Affiliation:
University of Warsaw, 00-901 Warsaw, Pkin IXP, Poland
Get access Rights & Permissions [Opens in a new window]

Abstract

Roughly speaking, a pattern is a finite sequence coding the set of natural numbers n for which the Σn+1 projectum is less than the Σ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 Δn projecta. The main technique, used throughout the paper, is Jensen's Uniformisation Theorem.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 46 , Issue 2 , June 1981 , pp. 287 - 295
Copyright
Copyright © Association for Symbolic Logic 1981

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1

This paper contains one chapter of the author's doctoral dissertation. I would like to express my gratitude to my advisor Professor Wiktor Marek for many illuminating discussions and specially for suggesting the subject.

References

REFERENCES

[1]Barwise, J., Admissible sets and structures, Springer-Verlag, Berlin and Heidelberg, 1975.CrossRefGoogle Scholar
[2]Barwise, J., Gandy, R. and Moschovakis, Y., The next admissible set, this Journal, vol. 36 (1971), pp. 108–120.Google Scholar
[3]Devlin, K. J., Aspects of constructibility, Lecture Notes in Mathematics, no. 354, Springer-Verlag, Berlin and New York, 1973.Google Scholar
[4]Jensen, R. B., The fine structure of the constructible hierarchy, Annals of Mathematical Logic, vol. 4 (1972), pp. 229–308.CrossRefGoogle Scholar
[5]Simpson, S. G., Short course on admissible recursion theory, Second Symposium on Generalized Recursion Theory, North-Holland, Amsterdam, 1978.Google Scholar