Abstract
Roughly speaking, ◇K,λ asserts the existence of a sequence of size <κ sets that captures every subset ofλ on a stationary set. The paper is devoted to the study of ◇K,λ and related principles, which are for instance obtained by considering sequences of larger sets, or by requesting the simultaneous capture of many subsets ofλ. Our main result is that ◇K,λ holds in caseλ>2<K.
Similar content being viewed by others
References
J. E. Baumgartner and A. D. Taylor,Saturation properties of ideals in generic extensions. I, Trans. Am. Math. Soc.270 (1982), 557–574.
J. E. Baumgartner,On the size of closed unbounded sets, Ann. Pure Appl. Logic54 (1991), 195–227.
M. R. Burke and M. Magidor,Shelah’s pcf theory and its applications, Ann. Pure Appl. Logic50 (1990), 207–254.
K. J. Devlin,Some weak versions of large cardinal axioms, Ann. Math. Logic5 (1973), 291–325.
C. A. Di Prisco and W. Marek,Some aspects of the theory of large cardinals, inMathematical Logic and Formal Systems (L. P. de Alcantara, ed.), Lecture Notes in Pure and Applied Mathematics 94, Dekker, New York, 1985, pp. 87–139.
Q. Feng,On weakly stationary sets, Proc. Am. Math. Soc.105 (1989), 727–735.
M. Gitik, Nonsplitting subset of\(\mathcal{P}_k \left( {k^ + } \right),\) J. Symbolic Logic50 (1985), 881–894.
J. Gregory,Higher Souslin trees and the generalized continuum hypothesis, J. Symbolic Logic41 (1976), 663–671.
T. J. Jech,Some combinatorial problems concerning uncountable cardinals, Ann. Math. Logic5 (1973), 165–198.
R. B. Jensen,The fine structure of the constructible hierarchy, Ann. Math. Logic4 (1972), 229–308.
D. Kueker,Countable approximations and Löwenheim-Skolem theorems, Ann. Math. Logic11 (1977), 57–103.
K. Kunen,Set Theory, North-Holland, Amsterdam, 1980.
M. Magidor,Representing sets of ordinals as countable unions of sets in the core model, Trans. Am. Math. Soc.317 (1990), 91–126.
P. Matet,Partitions and Diamond, Proc. Am. Math. Soc.97 (1986), 133–135.
P. Matet,On diamond sequences, Fund. Math.131 (1988), 35–44.
P. Matet, Concerning stationary subsets of\(\left[ \lambda \right]^{< k} ,\) inSet Theory and its Applications (J. Steprāns and S. Watson, eds.), Lecture Notes in Mathematics1401, Springer, Berlin, 1989, pp. 119–127.
T. K. Menas,On strong compactness and supercompactness, Ann. Math. Logic7 (1974), 327–359.
S. Shelah,On successors of singular cardinals, inLogic Colloquium 78 (M. Boffa, D. van Dalen and K. Mc Aloon, eds.), North-Holland, Amsterdam, 1979, pp. 357–380.
S. Shelah,Proper Forcing, Lecture Notes in Mathematics940, Springer, Berlin, 1982.
S. Shelah,More on stationary coding, inAround Classification Theory of Models, Lecture Notes in Mathematics1182, Springer, Berlin, 1986, pp. 224–246.
S. Shelah,Cardinal arithmetic for skeptics, Bull. Am. Math. Soc.26 (1992), 197–210.
C. I. Steinhorn and J. H. King, The uniformization property for ℵ2, Isr. J. Math.36 (1980), 248–256.
N. H. Williams,Combinatorial Set Theory, Studies in Logic and the Foundations of Mathematics 91, North-Holland, Amsterdam, 1977.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Donder, HD., Matet, P. Two cardinal versions of diamond. Israel J. Math. 83, 1–43 (1993). https://doi.org/10.1007/BF02764635
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02764635