Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-14T20:21:02.401Z Has data issue: false hasContentIssue false
  • English
  • Français

The combinatorial principle ⋄#

Published online by Cambridge University Press:  12 March 2014

Keith J. Devlin
Keith J. Devlin*
Affiliation:
University of Lancaster, Bailrigg, Lancaster, England
Get accessRights & Permissions [Opens in a new window]

Abstract

We consider various strengthenings of the combinatorial principle ◊+ which are provable from V = L, and give applications in set theory.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 47 , Issue 4 , December 1982, pp. 888 - 899
Copyright
Copyright © Association for Symbolic Logic 1982

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

References

REFERENCES

[1]Devlin, K. J., Aspects of constructibility, Lecture Notes in Mathematics, vol. 354, Springer-Verlag, Berlin and New York, 1973.CrossRefGoogle Scholar
[2]Devlin, K. J., Order-types, trees, and a problem of Erdös and Hajnal, Periodica Mathematica Hungarica, vol. 5 (1974), pp. 153–160.CrossRefGoogle Scholar
[3]Devlin, K. J., A new construction of a Kurepa tree with no Aronzsajn subtree, Fundamenta Mathematicae (to appear).Google Scholar
[4]Juhasz, J., and Weiss, W., On a problem of Sikorski, Fundamenta Mathematicae, vol. 100 (1978), pp. 223–227.CrossRefGoogle Scholar