A proof of Halpern-Läuchli partition theorem (Q1348762): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Nonstandard Combinatorics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Partition Theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Borel partitions of infinite subtrees of a perfect tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Ramsey theorem for trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partitions of Products / rank | |||
Normal rank |
Latest revision as of 09:36, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A proof of Halpern-Läuchli partition theorem |
scientific article |
Statements
A proof of Halpern-Läuchli partition theorem (English)
0 references
17 November 2002
0 references
This paper deals with the Halpern-Läuchli theorem which is a fundamental Ramsey type principle dealing with partitions of finite products of trees. The authors here present a proof of the Halpern-Läuchli partition theorem and its version for strong subtrees by proving a general statement of which these results of interest are an immediate consequence. The earlier proof uses some metamathematical tools which are difficult to follow, but the proof presented here avoids all those metamathematical arguments. This paper also includes some additional applications of this theorem in the area of metric spaces.
0 references
partitions of finite products of trees
0 references
Halpern-Läuchli partition theorem
0 references