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

The Ostaszewski square, and homogenous Souslin trees (1105.2944v1)

Published 15 May 2011 in math.LO

Abstract: Assume GCH and let $\lambda$ denote an uncountable cardinal. We prove that if $\square_\lambda$ holds, then this may be witnessed by a coherent sequence $< C_\alpha | \alpha < \lambda+ >$ with the following remarkable guessing property: For every sequence $< A_i | i<\lambda >$ of unbounded subsets of $\lambda+$, and every limit $\theta<\lambda$, there exists some $\alpha<\lambda+$ such that $\otp(C_\alpha)=\theta$, and the $(i+1){th}$-element of $C\alpha$ is a member of $A_i$, for all $i<\theta$. As an application, we construct an homogenous $\lambda+$-Souslin tree from $GCH+\square_\lambda$, for every singular cardinal $\lambda$. In addition, as a by-product, a theorem of Farah and Velickovic, and a theorem of Abraham, Shelah and Solovay are generalized to cover the case of successors of regulars.

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.

Authors (1)