Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Halpern-Läuchli Theorem at a Measurable Cardinal (1608.00592v3)

Published 1 Aug 2016 in math.LO

Abstract: Several variants of the Halpern-L\"auchli Theorem for trees of uncountable height are investigated. For $\kappa$ weakly compact, we prove that the various statements are all equivalent. We show that the strong tree version holds for one tree on any infinite cardinal. For any finite $d \ge 2$, we prove the consistency of the Halpern-L\"auchli Theorem on $d$ many $\kappa$-trees at a measurable cardinal $\kappa$, given the consistency of a $\kappa+d$-strong cardinal. This follows from a more general consistency result at measurable $\kappa$, which includes the possibility of infinitely many trees, assuming partition relations which hold in models of AD.

Summary

We haven't generated a summary for this paper yet.