Completely separable families and Ramsey's theorem

DOI10.1016/0097-3165(75)90056-4zbMath0316.05002OpenAlexW2091690195MaRDI QIDQ1221113

Keith R. Milliken

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(75)90056-4

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial set theory (03E05)

Related Items (5)

Partition Theorems and Ultrafilters ⋮ Combinatorics and forcing with distributive ideals ⋮ Cardinal Representations for Closures and Preclosures ⋮ Happy families and completely Ramsey sets ⋮ Mathias and set theory

Cites Work

• Classifying almost-disjoint families with applications to \(\beta N-N\)
• A new proof that analytic sets are Ramsey
• Borel sets and Ramsey's theorem
• Every analytic set is Ramsey
• Internal cohen extensions
• Ultrafilters on a countable set
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completely separable families and Ramsey's theorem