Archives
Keywords
Fodor-type reflection Shelah's Strong Hypothesis Amenable C-sequence Iterated forcing polarized partition relation Subnormal ideal L-space Minimal Walks SNR Diamond-sharp weak diamond Jonsson cardinal Microscopic Approach Strongly compact cardinal Erdos Cardinal indecomposable filter xbox Large Cardinals AIM forcing stationary hitting Vanishing levels Postprocessing function Closed coloring Rainbow sets Knaster and friends Lipschitz reduction Uniformization Interval topology on trees weak square Distributive tree Fat stationary set Dowker space stationary reflection transformations free Souslin tree Forcing 54G20 free Boolean algebra Poset Sakurai's Bell inequality Prevalent singular cardinals Diamond Hereditarily Lindelöf space Strong coloring unbounded function Subtle tree property Generalized descriptive set theory Knaster Whitehead Problem Sigma-Prikry Monotonically far Ascent Path Foundations S-Space Forcing Axioms Precaliber Reflecting stationary set Small forcing Chromatic number Almost Souslin strongly bounded groups ccc GMA Martin's Axiom positive partition relation Universal Sequences coloring number diamond star weak Kurepa tree full tree Reduced Power Absoluteness projective Boolean algebra Intersection model Club Guessing incompactness ZFC construction Parameterized proxy principle PFA Slim tree Prikry-type forcing O-space PFA(S)[S] OCA square principles b-scale Successor of Regular Cardinal Fast club Ramsey theory over partitions middle diamond Was Ulam right? Weakly compact cardinal higher Baire space Selective Ultrafilter Hindman's Theorem Generalized Clubs Respecting tree Well-behaved magma Square-Brackets Partition Relations Uniformly homogeneous Strongly Luzin set Singular cardinals combinatorics Diamond for trees Commutative cancellative semigroups regressive Souslin tree Erdos-Hajnal graphs P-Ideal Dichotomy countably metacompact C-sequence tensor product graph Singular cofinality Subadditive Constructible Universe Ineffable cardinal Uniformly coherent Singular Density Subtle cardinal Almost-disjoint family Commutative projection system Cardinal Invariants Filter reflection approachability ideal Hedetniemi's conjecture Axiom R square Dushnik-Miller Kurepa Hypothesis Analytic sets Antichain Local Club Condensation. Open Access Forcing with side conditions super-Souslin tree Entangled linear order Coherent tree very good scale nonmeager set Partition Relations Souslin Tree Ostaszewski square Almost countably chromatic Rado's conjecture Nonspecial tree stick specializable Souslin tree Ulam matrix Mandelbrot set Partition relations for trees Cohen real Non-saturation Chang's conjecture sap Cardinal function Greatly Mahlo club_AD HOD Countryman line Sierpinski's onto mapping principle perfectly normal Ascending path Successor of Singular Cardinal Aronszajn tree reflection principles Rock n' Roll Luzin set
Tag Archives: Ascending path
Walks on uncountable ordinals and non-structure theorems for higher Aronszajn lines
Joint work with Tanmay Inamdar. Abstract. We investigate global structural properties of linear orders of a fixed infinite size. It is classical that the countable linear orders and the continuum-sized orders exhibit contrasting behaviours. Modern results show that strong extensions … Continue reading
Posted in Basis problems, Partition Relations, Preprints
Tagged Aronszajn tree, Ascending path, Club Guessing, Countryman line, Entangled linear order, Minimal Walks, Monotonically far, Partition relations for trees, Strong coloring, Subtle tree property, Vanishing levels, ZFC construction
2 Comments
