Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 31 tok/s
GPT-5 High 36 tok/s Pro
GPT-4o 95 tok/s
GPT OSS 120B 478 tok/s Pro
Kimi K2 223 tok/s Pro
2000 character limit reached

Suslin trees, the bounding number, and partition relations (1602.07901v1)

Published 25 Feb 2016 in math.LO

Abstract: We investigate the unbalanced ordinary partition relations of the form $\lambda \rightarrow {(\lambda, \alpha)}{2}$ for various values of the cardinal $\lambda$ and the ordinal $\alpha$. For example, we show that for every infinite cardinal $\kappa,$ the existence of a ${\kappa}{+}-$Suslin tree implies ${\kappa}{+} \not\rightarrow {\left( {\kappa}{+}, {\log}{\kappa}({\kappa}{+}) + 2 \right)}{2}$. The consistency of the positive partition relation $\mathfrak{b} \rightarrow {(\mathfrak{b}, \alpha)}{2}$ for all $\alpha < {\omega}{1}$ for the bounding number $\mathfrak{b}$ is also established from large cardinals.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.