Skip to main navigation Skip to search Skip to main content

Borel partitions of infinite subtrees of a perfect tree

  • A. Louveau
  • , S. Shelah*
  • , B. Veličković
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

21 Scopus citations

Abstract

Louveau, A., S. Shelah and B. Veličković, Borel partitions of infinite subtrees of a perfect tree, Annals of Pure and Applied Logic 63 (1993) 271-281. We define a notion of type of a perfect tree and show that, for any given type τ, if the set of all subtrees of a given perfect tree T which have type τ is partitioned into two Borel classes then there is a perfect subtree S of T such that all subtrees of S of type τ belong to the same class. This result simultaneously generalizes the partition theorems of Galvin-Prikry and Galvin-Blass. The key ingredient of the proof is the theorem of Halpern-Laüchli on partitions of products of perfect trees.

Original languageEnglish
Pages (from-to)271-281
Number of pages11
JournalAnnals of Pure and Applied Logic
Volume63
Issue number3
DOIs
StatePublished - 24 Sep 1993

Fingerprint

Dive into the research topics of 'Borel partitions of infinite subtrees of a perfect tree'. Together they form a unique fingerprint.

Cite this