Appropriate hierarchies are essential for the study of minimal or constructible inner models of set theory, in particular for proving strong combinatorial principles in those models. We define a fine structural hierarchy (Fαá) and compare it to Jensen’s well-known Jáα-hierarchy for Güdel’s constructible universe L.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this paper
Cite this paper
Koepke, P., van Eijmeren, M. (2004). A refinement of Jensen's constructible hierarchy. In: Löwe, B., Piwinger, B., Räsch, T. (eds) Classical and New Paradigms of Computation and their Complexity Hierarchies. Trends in Logic, vol 23. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-2776-5_9
Download citation
DOI: https://doi.org/10.1007/978-1-4020-2776-5_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-2775-8
Online ISBN: 978-1-4020-2776-5
eBook Packages: Springer Book Archive