Complete coloring

From formulasearchengine
Revision as of 09:11, 13 March 2013 by en>Addbot (Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q3342988)
Jump to navigation Jump to search

In mathematics, and particularly in axiomatic set theory, S (clubsuit) is a family of combinatorial principles that are weaker version of the corresponding S; it was introduced in 1975 .

Definition

For a given cardinal number κ and a stationary set Sκ, S is the statement that there is a sequence Aδ:δS such that

ω1 is usually written as just .

♣ and ◊

It is clear that ◊ ⇒ ♣, and it was shown in 1975 that ♣ + CH ⇒ ◊; however, Saharon Shelah gave a proof in 1980 that there exists a model of ♣ in which CH does not hold, so ♣ and ◊ are not equivalent (since ◊ ⇒ CH).

References

  • A. J. Ostaszewski, On countably compact perfectly normal spaces, Journal of London Mathematical Society, 1975 (2) 14, pp. 505-516.
  • S. Shelah, Whitehead groups may not be free, even assuming CH, II, Israel Journal of Mathematics, 1980 (35) pp. 257-285.

See also