Keywords
- Natural Number
- Initial Segment
- Sequential Tree
- Finite Lattice
- Complete Boolean Algebra
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ź. Adamowicz: On finite lattices of degrees of constructibility of reals, Journ. Symb. Log. 41 (1976), 313–322
B.Balcar and P.Hájek: On sequences of degrees of constructibility, Zeitschr. Math. Log. (to appear)
W. Boos: Lectures on large cardinals axioms, in: Logic Conference Kiel 1974 (G.H. Müller, A. Oberschelp and K. Potthof, eds.) Lect. Notes in Math. 499, Springer-Verlag 1975, p.25–88
H. Friedman: Minimality in the Δ 12 degrees, Fund. Math. 81 (1974), 183–192
L.Harrington and A.Kechris: π 12 singletons and O# Fund. Math. (to appear)
T.J.Jech: Lectures in Set Theory, Lecture Notes in Math. 217, Springer-Verlag 1971
T.J. Jech: Trees, Journ. Symb. Log. 36 (1971), 1–14
T.J.Jech: a prepared monograph on set theory
R.Jensen: Definable sets of minimal degree, in: Mathematical Logic and Foundations of Set Theory (Y.Bar-Hillel, ed.), North-Holland P.C. 1970, p.122–128
R. Jensen and H. Johnsbraten: A new construction of a non-constructible Δ 13 subset of ω, Fund. Math. 81 (1974), 279–290
A.H. Lachlan and R. Lebeuf: Countable initial segments of the degrees of unsolvability, Journ. Symb. Log. 41 (1976), 289–300
G.E.Sacks: Degrees of Unsolvability, Princeton Univ. Press 1963
J.R.Shoenfield: Degrees of Unsolvability, North-Holland P.C.1971
J.R.Shoenfield: Mathematical Logic, Addison-Wesley 1967
R. Solovay: A non-constructible Δ 13 set of integers, Trans. Amer. Math. Soc. 127 (1967) 50–75
R. Solovay: A model of set theory in which every set of reals is Lebesgue measurable, Ann. of Math. 92 (1970) 1–56
R. Solovay and S. Tennenbaum: Iterated Cohen extensions and Souslin's problem, Ann. of Math. 94 (1971) 201–245
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag
About this paper
Cite this paper
Hájek, P. (1978). Some results on degrees of constructibility. In: Müller, G.H., Scott, D.S. (eds) Higher Set Theory. Lecture Notes in Mathematics, vol 669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0103102
Download citation
DOI: https://doi.org/10.1007/BFb0103102
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08926-1
Online ISBN: 978-3-540-35749-0
eBook Packages: Springer Book Archive
