Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Ostaszewski square, and homogenous Souslin trees

Published 15 May 2011 in math.LO | (1105.2944v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Authors (1)

Collections

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