Archives
Keywords
Hereditarily Lindelöf space Reflecting stationary set Singular cofinality Jonsson cardinal Large Cardinals higher Baire space Absoluteness Vanishing levels specializable Souslin tree Fodor-type reflection Nonspecial tree Filter reflection Rock n' Roll polarized partition relation approachability ideal Partition Relations Axiom R Universal Sequences Slim tree Almost Souslin ccc S-Space weak diamond positive partition relation Analytic sets Strongly Luzin set Rainbow sets projective Boolean algebra transformations full tree P-Ideal Dichotomy tensor product graph Almost-disjoint family Successor of Singular Cardinal reflection principles stationary reflection super-Souslin tree indecomposable ultrafilter 54G20 L-space Dowker space xbox Square-Brackets Partition Relations AIM forcing Prevalent singular cardinals Hedetniemi's conjecture Reduced Power Shelah's Strong Hypothesis Small forcing Prikry-type forcing Open Access free Boolean algebra Hindman's Theorem Closed coloring weak square Uniformly coherent stick Erdos Cardinal Knaster and friends Iterated forcing Local Club Condensation. Generalized descriptive set theory Uniformization Sigma-Prikry Subtle cardinal Ineffable cardinal Parameterized proxy principle Generalized Clubs PFA Sierpinski's onto mapping principle club_AD Cardinal Invariants C-sequence Well-behaved magma sap O-space Chang's conjecture strongly bounded groups weak Kurepa tree Erdos-Hajnal graphs Sakurai's Bell inequality Was Ulam right Singular Density Kurepa Hypothesis middle diamond Successor of Regular Cardinal Luzin set OCA Aronszajn tree HOD Almost countably chromatic SNR Ulam matrix Coherent tree Uniformly homogeneous Selective Ultrafilter Singular cardinals combinatorics Chromatic number Club Guessing free Souslin tree b-scale Subnormal ideal very good scale Subtle tree property Minimal Walks Ascent Path nonmeager set diamond star square principles Whitehead Problem GMA Microscopic Approach Souslin Tree Rado's conjecture Strong coloring Martin's Axiom regressive Souslin tree Diamond-sharp Poset Forcing Axioms Precaliber countably metacompact Amenable C-sequence ZFC construction Cohen real coloring number Forcing stationary hitting Greatly Mahlo Fat stationary set Cardinal function Ramsey theory over partitions incompactness Constructible Universe PFA(S)[S] Subadditive Antichain Fast club Non-saturation Knaster Commutative cancellative semigroups Diamond for trees Weakly compact cardinal Mandelbrot set Lipschitz reduction square Foundations Ostaszewski square unbounded function Diamond Postprocessing function Dushnik-Miller Distributive tree
Tag Archives: Almost-disjoint family
The vanishing levels of a tree
Joint work with Shira Yadai and Zhixing You. Abstract. We initiate the study of the spectrum $Vspec(\kappa)$ of sets that can be realized as the vanishing levels $V(\mathbf T)$ of a normal $\kappa$-tree $\mathbf T$. The latter is an invariant in … Continue reading
Posted in Preprints, Souslin Hypothesis
Tagged Almost-disjoint family, C-sequence, Coherent tree, Parameterized proxy principle, regressive Souslin tree, Subtle tree property, Uniformly homogeneous, Vanishing levels
Comments Off on The vanishing levels of a tree
Universal binary sequences
Notation. Write $\mathcal Q(A):=\{ a\subseteq A\mid a\text{ is finite}, a\neq\emptyset\}$. Suppose for the moment that we are given a fixed sequence $\langle f_\alpha:\omega\rightarrow2\mid \alpha\in a\rangle$, indexed by some set $a$ of ordinals. Then, for every function $h:a\rightarrow\omega$ and $i<\omega$, we … Continue reading
The Engelking-Karlowicz theorem, and a useful corollary
Theorem (Engelking-Karlowicz, 1965). For cardinals $\kappa\le\lambda\le\mu\le 2^\lambda$, the following are equivalent: $\lambda^{<\kappa}=\lambda$; there exists a collection of functions, $\langle f_i:\mu\rightarrow\lambda\mid i<\lambda\rangle$, such that for every $X\in[\mu]^{<\kappa}$ and every function $f:X\rightarrow\lambda$, there exists some $i<\lambda$ with $f\subseteq f_i$. Proof. (2)$\Rightarrow$(1) Suppose … Continue reading