Archives
Keywords
Closed coloring Non-saturation stationary hitting Fast club Souslin Tree Countryman line middle diamond Singular cofinality diamond star Martin's Axiom Subnormal ideal PFA(S)[S] Ramsey theory over partitions coloring number Diamond for trees Strongly compact cardinal O-space Diamond Uniformly coherent Uniformization ZFC construction Small forcing Almost Souslin Subtle tree property Forcing Ineffable cardinal Cardinal function stationary reflection Kurepa Hypothesis ccc higher Baire space Hindman's Theorem free Boolean algebra Forcing Axioms specializable Souslin tree Erdos-Hajnal graphs Jonsson cardinal polarized partition relation incompactness Chang's conjecture Rock n' Roll Poset Postprocessing function club_AD transformations Hedetniemi's conjecture Intersection model Universal Sequences Strongly Luzin set Distributive tree Sigma-Prikry approachability ideal Absoluteness OCA Mandelbrot set Lipschitz reduction Successor of Singular Cardinal PFA Rado's conjecture Microscopic Approach square Rainbow sets countably metacompact Club Guessing Chromatic number Cohen real Axiom R Slim tree Reflecting stationary set projective Boolean algebra Well-behaved magma Almost countably chromatic Aronszajn tree Whitehead Problem regressive Souslin tree SNR Respecting tree reflection principles unbounded function Dushnik-Miller Shelah's Strong Hypothesis Commutative projection system Coherent tree full tree free Souslin tree square principles nonmeager set weak Kurepa tree super-Souslin tree xbox Amenable C-sequence Greatly Mahlo Parameterized proxy principle HOD Fodor-type reflection S-Space Precaliber Dowker space very good scale strongly bounded groups Subtle cardinal Nonspecial tree AIM forcing Antichain Singular Density indecomposable ultrafilter Selective Ultrafilter Strong coloring C-sequence Almost-disjoint family Square-Brackets Partition Relations Ostaszewski square Generalized Clubs stick Successor of Regular Cardinal Subadditive sap Was Ulam right? Vanishing levels Prikry-type forcing Constructible Universe P-Ideal Dichotomy Ascent Path Luzin set Reduced Power Analytic sets Sakurai's Bell inequality Fat stationary set weak diamond Generalized descriptive set theory Sierpinski's onto mapping principle weak square Knaster and friends Foundations 54G20 Ulam matrix Weakly compact cardinal Open Access tensor product graph Diamond-sharp Prevalent singular cardinals Cardinal Invariants Local Club Condensation. Partition Relations b-scale L-space Commutative cancellative semigroups Knaster Hereditarily Lindelöf space Iterated forcing Minimal Walks GMA Singular cardinals combinatorics Large Cardinals positive partition relation Filter reflection Uniformly homogeneous Erdos Cardinal
Category Archives: Compactness
Chromatic numbers of graphs – large gaps
Abstract. We say that a graph
Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Almost countably chromatic, Chromatic number, incompactness, Ostaszewski square
6 Comments
A topological reflection principle equivalent to Shelah’s strong hypothesis
Abstract: We notice that Shelah’s Strong Hypothesis (SSH) is equivalent to the following reflection principle: Suppose
Posted in Compactness, Publications, Topology
Tagged 03E04, 03E65, 54G15, Open Access, Shelah's Strong Hypothesis
Leave a comment
Openly generated Boolean algebras and the Fodor-type reflection principle
Joint work with Sakaé Fuchino. Abstract: We prove that the Fodor-type Reflection Principle (FRP) is equivalent to the assertion that any Boolean algebra is openly generated if and only if it is
Posted in Compactness, Publications
Tagged 03E35, 03E55, 03E65, 03E75, 03G05, 06E05, Axiom R, Fodor-type reflection, free Boolean algebra, projective Boolean algebra, Shelah's Strong Hypothesis, stationary reflection
Comments Off on Openly generated Boolean algebras and the Fodor-type reflection principle
