Archives
Keywords
Uniformization Hereditarily Lindelöf space positive partition relation Erdos-Hajnal graphs incompactness approachability ideal Precaliber Postprocessing function Microscopic Approach unbounded function Iterated forcing Club Guessing Greatly Mahlo Antichain specializable Souslin tree Cardinal Invariants Well-behaved magma Axiom R PFA Poset nonmeager set Open Access Lipschitz reduction Absoluteness regressive Souslin tree Constructible Universe Vanishing levels Chang's conjecture free Boolean algebra weak square ZFC construction Generalized descriptive set theory diamond star OCA Ramsey theory over partitions Parameterized proxy principle Diamond-sharp Strongly Luzin set countably metacompact Partition Relations Prevalent singular cardinals projective Boolean algebra Large Cardinals 54G20 O-space Cardinal function Distributive tree Aronszajn tree Reduced Power Sakurai's Bell inequality stationary hitting Selective Ultrafilter Nonspecial tree Singular cofinality Almost countably chromatic reflection principles Erdos Cardinal Fodor-type reflection Singular cardinals combinatorics Analytic sets Fast club strongly bounded groups Subtle tree property Coherent tree Fat stationary set Non-saturation Generalized Clubs Kurepa Hypothesis square polarized partition relation Ostaszewski square GMA Knaster Foundations square principles Diamond Filter reflection P-Ideal Dichotomy higher Baire space Small forcing Rock n' Roll Shelah's Strong Hypothesis Dowker space Square-Brackets Partition Relations HOD Uniformly coherent middle diamond Ineffable cardinal Prikry-type forcing coloring number Luzin set Successor of Regular Cardinal Subtle cardinal Was Ulam right Weakly compact cardinal Ulam matrix Dushnik-Miller Souslin Tree Diamond for trees Subnormal ideal Closed coloring Slim tree AIM forcing weak diamond Local Club Condensation. free Souslin tree very good scale Mandelbrot set Singular Density Rainbow sets Uniformly homogeneous Forcing Strong coloring Commutative cancellative semigroups Rado's conjecture Cohen real Almost Souslin indecomposable ultrafilter Sigma-Prikry sap b-scale Jonsson cardinal stationary reflection transformations Universal Sequences S-Space ccc Chromatic number Ascent Path tensor product graph C-sequence L-space PFA(S)[S] Hindman's Theorem super-Souslin tree Knaster and friends club_AD Reflecting stationary set stick Minimal Walks Sierpinski's onto mapping principle Forcing Axioms xbox Almost-disjoint family SNR Amenable C-sequence Martin's Axiom full tree Whitehead Problem Successor of Singular Cardinal Subadditive Hedetniemi's conjecture
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