Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T02:03:28.191Z Has data issue: false hasContentIssue false

Patterns of projecta1

Published online by Cambridge University Press:  12 March 2014

Adam Krawczyk*
Affiliation:
University of Warsaw, 00-901 Warsaw, Pkin IXP, Poland

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.

Information

Type
Research Article
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.)

Article purchase

Temporarily unavailable