Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-9pm4c Total loading time: 0 Render date: 2024-04-29T18:05:31.520Z Has data issue: false hasContentIssue false

Bibliography

Published online by Cambridge University Press:  30 March 2017

Keith J. Devlin
Affiliation:
Lancaster University
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Constructibility , pp. 415 - 418
Publisher: Cambridge University Press
Print publication year: 2017

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.)

References

Barwise, J. 1975 Admissible Sets and Structures. Springer-Verlag
Beller, A., Litman, A. 1980 A Strengthening of Jensen's □ Principles. J. Symbolic Logic 45, 251–264Google Scholar
Chang, C. C., Keisler, H. J. 1973 Model Theory. North Holland
Devlin, K. J. 1973 Aspects of Constructibility. Springer-Verlag: Lecture Notes in Mathematics 354
Devlin, K. J. 1979 Fundamentals of Contemporary Set Theory. Springer-Verlag
Devlin, K. J. 1979a Variations on ◊. J. Symbolic Logic 44, 51–58Google Scholar
Devlin, K. J., Jensen, R. B. 1975 Marginalia to a Theorem of Silver. In “Logic Conference Kiel 1974”. Springer- Verlag: Lecture Notes in Mathematics 499, 115–142
Devlin, K. J., Johnbråten, H. 1974 The Souslin Problem. Springer-Verlag: Lecture Notes in Mathematics 405
Donder, H. D. 1984 Another Look at Gap-1 Morasses. Proc. Cornell Meeting 1982
Drake, F. R. 1974 Set Theory: An Introduction to Large Cardinals. North Holland
Fodor, G. 1956 Eine Bemerkung zur Theorie der Regressiven Funktionen. Acta Sci. Math. (Szeged) 17, 139–142Google Scholar
Gaifman, H. 1964 Measurable Cardinals and Constructible Sets. Notices Amer. Math. Soc. 11, 771Google Scholar
Gandy, R. 1974 Set-Theoretic Functions for Elementary Syntax. In “Axiomatic Set Theory”. Proc. Symp. in Pure Math. 13, Part II (ed. Mathias, A.), Amer. Math. Soc.Google Scholar
Gödel, K. 1938 The Consistency of the Axiom of Choice and of the Generalised Continuum Hypothesis. Proc. Natl. Acad. USA 24, 556–557
Gödel, K. 1939 Consistency Proof for the Generalised Continuum Hypothesis. Proc. Natl. Acad. USA 25, 220–224
Gödel, K. 1940 The Consistency of the Axiom of Choice and of the Generalised Continuum Hypothesis. Ann. Math. Studies 3Google Scholar
Gregory, J. 1976 Higher Souslin Trees and the Generalised Continuum Hypothesis. J. Symb. Logic 14, 663–671Google Scholar
Hajnal, A. 1956 On a Consistency Theorem Connected with the Generalised Continuum Problem. Zeit. Math. Logik 2, 131–136Google Scholar
Jech, T. 1978 Set Theory. Academic Press
Jensen, R. B. 1968 Souslin's Hypothesis is Incompatible with V = L. Notices Amer. Math. Soc. 15, 935Google Scholar
Jensen, R. B. 1972 The Fine Structure of the Constructive Hierarchy. Annals of Math. Logic 4, 229–308Google Scholar
Jensen, R. B., Karp, C. 1971 Primitive Recursive Set Functions. In Axiomatic Set Theory: Proc. Symp. Pure Math. 13, (ed. Scott, D.), Amer. Math. Soc. 143–167Google Scholar
Kanamori, A. 1982 On Silver's and Related Principles. In “Logic Colloquium '80” (ed. van Dalen, et al.), North Holland
Karp, C. 1967 A Proof of the Relative Consistency of the Continuum Hypothesis. In “Sets, Models and Recursion Theory” (ed. Crossley, J.), North Holland, 1–32
Kripke, S. 1964 Transfinite Recursion on Admissible Ordinals, I, II. J. Symbolic Logic 29, 161–162Google Scholar
Kurepa, D. 1935 Ensembles Ordonnés et Ramifiés. Publ. Math. Univ. Belgrade 4, 1–138
Lévy, A. 1957 Indépendence Conditionnelle de V = L et d'Axiomes qui se Rattachent au Systeme de M. Gödel. C.R. Acad. Sci. Paris 245, 1582–1583
Lévy, A. 1960 Axiom Schemata of Strong Infinity in Axiomatic Set Theory. Pacific J. Math. 10, 223–238Google Scholar
Lévy, A. 1965 A Hierarchy of Formulas in Set Theory. Memoirs Amer. Math. Soc. 57Google Scholar
Lévy, A. 1979 Basic Set Theory. Springer-Verlag
Mitchell, W. 1972 Aronszajn Trees and the Independence of the Transfer Property. Annals Math. Logic 5, 21–46Google Scholar
Montague, R. M. 1961 Fraenkel's Addition to the Axioms of Zermelo. In “Essays on the Foundations of Mathematics” (ed. Bar-Hillel, Y. et al.). The Magnes Press (Jerusalem), 91–114
Morley, M., Vaught, R. 1962 Homogeneous Universal Models. Math. Scand. 11, 37–57Google Scholar
Mostowski, A. 1949 An Undecidable Arithmetical Statement. Fund. Math. 36, 143–164Google Scholar
Platek, R. 1966 Foundations of Recursion Theory. PhD thesis, Stanford University
Prikry, K. L., Solovay, R. M. 1975 On Partitions into Stationary Sets. J. Symbolic Logic 40, 75–80Google Scholar
Rowbottom, F. 1971 Some Strong Axioms of Infinity Incompatible with the Axiom of Constructibility. Ann. of Math. Logic 3, 1–44Google Scholar
Shelah, S., Stanley, L. J. 1983 S-Forcing, I: A “Black Box” Theorem for MorassesGoogle Scholar
Shepherdson, J. 1951/52 Inner Models of Set Theory. J. Symbolic Logic 16, 161–190; 17, 225–237;Google Scholar
Shepherdson, J. 1953 18, 145–167
Silver, J. H. 1971 Some Applications of Model Theory in Set Theory. Ann. of Math. Logic 3, 45–110Google Scholar
Silver, J. H. 1971a The Independence of Kurepa's Conjecture and Two-Cardinal Conjectures in Model Theory. In “Axiomatic Set Theory”, proc. Symp. in Pure Math. 13 (ed. Scott, D.), Amer. Math. Soc. 383–390Google Scholar
Solovay, R. M. 1967 A Nonstructible Δ13 Set of Integers. Trans. Amer. Math. Soc. 127, 50–75Google Scholar
Solovay, R. M., Tennenbaum, S. 1971 Iterated Cohen Extensions and Souslin's Problem. Ann. of Math. 94, 201–245Google Scholar
Souslin, M. 1920 Problème 3. Fund. Math. 1, 223Google Scholar
Stanley, L. J. 1975 L-Like Models of Set Theory: Forcing, Combinatorial Principles, and Morasses. PhD Thesis (Berkeley)
Todorcevic, S. 1983 Trees and Linearly Ordered Sets. In “Topology HandbookGoogle Scholar
Velleman, D. 1984 Simplified Morasses. J. Symbolic LogicGoogle Scholar
Velleman, D. 1984a Simplified Morasses with Linear Limits. J. Symbolic LogicGoogle Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Bibliography
  • Keith J. Devlin, Lancaster University
  • Book: Constructibility
  • Online publication: 30 March 2017
  • Chapter DOI: https://doi.org/10.1017/9781316717219.012
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Bibliography
  • Keith J. Devlin, Lancaster University
  • Book: Constructibility
  • Online publication: 30 March 2017
  • Chapter DOI: https://doi.org/10.1017/9781316717219.012
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Bibliography
  • Keith J. Devlin, Lancaster University
  • Book: Constructibility
  • Online publication: 30 March 2017
  • Chapter DOI: https://doi.org/10.1017/9781316717219.012
Available formats
×