Partitions of Products

DOI10.2307/1998670zbMATH Open0485.03021OpenAlexW4240910869MaRDI QIDQ3944589FDOQ3944589

Authors: 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)

Cites Work

• Set Theory
• Combinatorics on ideals and forcing
• Title not available (Why is that?)
• The independence of the axiom of choice from the Boolean prime ideal theorem
• A Partition Theorem
• A Ramsey theorem for trees
• Adding dependent choice
• Nonstandard Combinatorics
• On the Independence of the Kinna Wagner Principle

Cited In (8)

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

This page was built for publication: Partitions of Products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3944589)