Partitions of Products

DOI10.2307/1998670MaRDI QIDQ3944589zbMATH OpenOpenAlexFDO

Authors David Pincus, J. D. Halpern

Publication date 1981

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

zbMATH Keywords

finitary treesSacks forcingSacks realsselective ultrafilterweak 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

• A Partition Theorem
• A Ramsey theorem for trees
• Adding dependent choice
• Combinatorics on ideals and forcing
• scientific article; zbMATH DE number 3732040 (Why is no real title available?)
• Nonstandard Combinatorics
• On the Independence of the Kinna Wagner Principle
• Set Theory
• The independence of the axiom of choice from the Boolean prime ideal theorem

Cited in

(9)

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

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)