Archives
Keywords
Aronszajn tree projective Boolean algebra Selective Ultrafilter Subtle cardinal Distributive tree Open Access square Diamond Diamond-sharp sap incompactness Forcing Axioms L-space weak diamond Fodor-type reflection Local Club Condensation. strongly bounded groups Martin's Axiom Jonsson cardinal Hindman's Theorem Sierpinski's onto mapping principle Generalized descriptive set theory Respecting tree Minimal Walks Prevalent singular cardinals Mandelbrot set Rado's conjecture Strong coloring Closed coloring Knaster Subtle tree property polarized partition relation Fat stationary set Singular cardinals combinatorics super-Souslin tree Universal Sequences indecomposable ultrafilter weak square free Souslin tree Ramsey theory over partitions Kurepa Hypothesis Almost-disjoint family Almost Souslin Subadditive stationary reflection Commutative cancellative semigroups Cardinal Invariants Lipschitz reduction Subnormal ideal nonmeager set Strongly Luzin set countably metacompact Uniformization xbox Ostaszewski square Sakurai's Bell inequality free Boolean algebra Ulam matrix Dushnik-Miller square principles Weakly compact cardinal PFA(S)[S] Parameterized proxy principle Luzin set Erdos Cardinal specializable Souslin tree Commutative projection system OCA Rock n' Roll 54G20 Successor of Singular Cardinal Vanishing levels Analytic sets Countryman line Was Ulam right? reflection principles Intersection model Partition Relations regressive Souslin tree HOD Hereditarily Lindelöf space Club Guessing coloring number Strongly compact cardinal Greatly Mahlo tensor product graph Knaster and friends Forcing Iterated forcing Slim tree SNR Cohen real Coherent tree Filter reflection Chromatic number Almost countably chromatic b-scale Erdos-Hajnal graphs GMA C-sequence Amenable C-sequence Shelah's Strong Hypothesis Postprocessing function Prikry-type forcing ccc Dowker space unbounded function Fast club stick Souslin Tree Successor of Regular Cardinal Well-behaved magma Sigma-Prikry Large Cardinals Constructible Universe Ascent Path Reflecting stationary set higher Baire space Square-Brackets Partition Relations middle diamond weak Kurepa tree positive partition relation Rainbow sets diamond star Singular cofinality Uniformly homogeneous stationary hitting Antichain Singular Density Microscopic Approach very good scale PFA Nonspecial tree Hedetniemi's conjecture Uniformly coherent approachability ideal O-space Non-saturation Precaliber club_AD AIM forcing full tree Generalized Clubs Poset Cardinal function Ineffable cardinal Absoluteness transformations Small forcing Whitehead Problem ZFC construction Chang's conjecture Reduced Power Axiom R P-Ideal Dichotomy Diamond for trees Foundations S-Space
Tag Archives: 03E65
A remark on Schimmerling’s question
Joint work with Ari Meir Brodsky. Abstract. Schimmerling asked whether
A microscopic approach to Souslin-tree constructions. Part I
Joint work with Ari Meir Brodsky. Abstract. We propose a parameterized proxy principle from which
Posted in Publications, Souslin Hypothesis
Tagged 03E05, 03E35, 03E65, 05C05, Coherent tree, Diamond, Microscopic Approach, Parameterized proxy principle, Slim tree, Souslin Tree, square, xbox
5 Comments
Reduced powers of Souslin trees
Joint work with Ari Meir Brodsky. Abstract. We study the relationship between a
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
On guessing generalized clubs at the successors of regulars
Abstract: Konig, Larson and Yoshinobu initiated the study of principles for guessing generalized clubs, and introduced a construction of an higher Souslin tree from the strong guessing principle. Complementary to the author’s work on the validity of diamond and non-saturation … Continue reading
On the consistency strength of the Milner-Sauer conjecture
Abstract: In their paper from 1981, Milner and Sauer conjectured that for any poset
