Journal of Symbolic Logic 47 (4):888-899 (1982)

We consider various strengthenings of the combinatorial principle ⋄ + which are provable from V = L, and give applications in set theory
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273107
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 59,968
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Measurable Cardinals and a Combinatorial Principle of Jensen.Keith J. Devlin - 1973 - Journal of Symbolic Logic 38 (4):551-560.
Variations on ◊.Keith J. Devlin - 1979 - Journal of Symbolic Logic 44 (1):51 - 58.
Variations on \Diamond.Keith J. Devlin - 1979 - Journal of Symbolic Logic 44 (1):51-58.
Subsystems of True Arithmetic and Hierarchies of Functions.Z. Ratajczyk - 1993 - Annals of Pure and Applied Logic 64 (2):95-152.
On a Combinatorial Principle of Hajnal and Komjáth.Dan Velleman - 1986 - Journal of Symbolic Logic 51 (4):1056-1060.
Some Combinatorial and Algorithmic Problems in Many-Valued Logics.Ivan Stojmenović - 1987 - University of Novi Sad, Faculty of Science, Institute of Mathematics.
Incompatible Extensions of Combinatorial Functions.Erik Ellentuck - 1983 - Journal of Symbolic Logic 48 (3):752-755.


Added to PP index

Total views
45 ( #230,448 of 2,433,333 )

Recent downloads (6 months)
1 ( #468,801 of 2,433,333 )

How can I increase my downloads?


Sorry, there are not enough data points to plot this chart.

My notes