Partitions of Products

DOI10.2307/1998670zbMath0485.03021OpenAlexW4240910869MaRDI QIDQ3944589

David Pincus, J. D. Halpern

Publication date: 1981

Full work available at URL: https://doi.org/10.2307/1998670

zbMATH Keywords

selective ultrafilterSacks forcingfinitary treesSacks realsweak infinite products of the set of rationals

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Other aspects of forcing and Boolean-valued models (03E40)

Related Items

A proof of Halpern-Läuchli partition theorem, Partition theorems from creatures and idempotent ultrafilters, Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective, A density version of the Halpern-Läuchli theorem, Laver and set theory, Ramsey families of subtrees of the dyadic tree, Semiselective coideals, A dual form of Ramsey's theorem

Cites Work

• Unnamed Item
• A Ramsey theorem for trees
• Nonstandard Combinatorics
• On the Independence of the Kinna Wagner Principle
• Combinatorics on ideals and forcing
• Adding dependent choice
• Set Theory
• The independence of the axiom of choice from the Boolean prime ideal theorem
• A Partition Theorem