Archives
Keywords
approachability ideal Dowker space Fat stationary set tensor product graph Diamond Strong coloring sap P-Ideal Dichotomy Rainbow sets Precaliber Erdos-Hajnal graphs Subadditive ZFC construction Dushnik-Miller Well-behaved magma Almost countably chromatic Aronszajn tree nonmeager set Ramsey theory over partitions Singular Density Forcing specializable Souslin tree polarized partition relation middle diamond Strongly compact cardinal Hedetniemi's conjecture coloring number Selective Ultrafilter Sakurai's Bell inequality Diamond for trees C-sequence Greatly Mahlo free Souslin tree Chang's conjecture projective Boolean algebra L-space Commutative cancellative semigroups Coherent tree Analytic sets Hereditarily Lindelöf space Knaster stationary reflection Almost Souslin Sierpinski's onto mapping principle Sigma-Prikry countably metacompact 54G20 S-Space Fodor-type reflection Cohen real Axiom R club_AD Universal Sequences Microscopic Approach Non-saturation HOD Chromatic number Vanishing levels Cardinal function diamond star Absoluteness Ulam matrix incompactness Reduced Power Knaster and friends Countryman line Forcing Axioms unbounded function square Uniformly homogeneous Singular cardinals combinatorics Successor of Regular Cardinal Generalized Clubs Amenable C-sequence PFA(S)[S] Filter reflection weak diamond positive partition relation Distributive tree stick Partition Relations Subnormal ideal Mandelbrot set Singular cofinality Intersection model Respecting tree Ascent Path Fast club Local Club Condensation. Reflecting stationary set Lipschitz reduction Antichain indecomposable ultrafilter Parameterized proxy principle AIM forcing Rado's conjecture Prikry-type forcing Large Cardinals strongly bounded groups Minimal Walks Erdos Cardinal xbox reflection principles O-space Almost-disjoint family Constructible Universe free Boolean algebra transformations weak square Rock n' Roll Whitehead Problem Slim tree Closed coloring Uniformization stationary hitting Ostaszewski square Successor of Singular Cardinal Prevalent singular cardinals super-Souslin tree Souslin Tree Shelah's Strong Hypothesis Postprocessing function Cardinal Invariants Uniformly coherent ccc Club Guessing SNR Diamond-sharp OCA Square-Brackets Partition Relations PFA Luzin set Open Access Poset very good scale Commutative projection system b-scale Generalized descriptive set theory higher Baire space Ineffable cardinal Strongly Luzin set regressive Souslin tree Weakly compact cardinal Iterated forcing Nonspecial tree Subtle cardinal Foundations GMA weak Kurepa tree Martin's Axiom Subtle tree property Jonsson cardinal Was Ulam right Kurepa Hypothesis Small forcing square principles full tree Hindman's Theorem
Tag Archives: Weakly compact cardinal
Was Ulam right? I: Basic theory and subnormal ideals
Joint work with Tanmay Inamdar. Abstract. We introduce various coloring principles which generalize the so-called onto mapping principle of Sierpinski to larger cardinals and general ideals. We prove that these principles capture the notion of an Ulam matrix and allow … Continue reading
Fake Reflection
Joint work with Gabriel Fernandes and Miguel Moreno. Abstract. We introduce a generalization of stationary set reflection which we call filter reflection, and show it is compatible with the axiom of constructibility as well as with strong forcing axioms. We … Continue reading
The eightfold way
Joint work with James Cummings, Sy-David Friedman, Menachem Magidor, and Dima Sinapova. Abstract. Three central combinatorial properties in set theory are the tree property, the approachability property and stationary reflection. We prove the mutual independence of these properties by showing … Continue reading
Strong failures of higher analogs of Hindman’s Theorem
Joint work with David J. Fernández Bretón. Abstract. We show that various analogs of Hindman’s Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1. There exists a colouring $c:\mathbb R\rightarrow\mathbb Q$, such that … Continue reading
Posted in Groups, Partition Relations, Publications
Tagged 03E02, 03E35, 03E75, 05A17, 05D10, 11P99, 20M14, Chang's conjecture, Commutative cancellative semigroups, Erdos Cardinal, Hindman's Theorem, Jonsson cardinal, Kurepa Hypothesis, Square-Brackets Partition Relations, Weakly compact cardinal, ZFC construction
1 Comment
The reflection principle $R_2$
A few years ago, in this paper, I introduced the following reflection principle: Definition. $R_2(\theta,\kappa)$ asserts that for every function $f:E^\theta_{<\kappa}\rightarrow\kappa$, there exists some $j<\kappa$ for which the following set is nonstationary: $$A_j:=\{\delta\in E^\theta_\kappa\mid f^{-1}[j]\cap\delta\text{ is nonstationary}\}.$$ I wrote there … Continue reading
Posted in Blog
Tagged reflection principles, square, stationary reflection, Weakly compact cardinal
Leave a comment
Higher Souslin trees and the GCH, revisited
Abstract. It is proved that for every uncountable cardinal $\lambda$, GCH+$\square(\lambda^+)$ entails the existence of a $\text{cf}(\lambda)$-complete $\lambda^+$-Souslin tree. In particular, if GCH holds and there are no $\aleph_2$-Souslin trees, then $\aleph_2$ is weakly compact in Godel’s constructible universe, improving … Continue reading
Posted in Publications, Souslin Hypothesis
Tagged 03E05, 03E35, Open Access, regressive Souslin tree, Souslin Tree, square, Weakly compact cardinal, xbox
16 Comments
Chain conditions of products, and weakly compact cardinals
Abstract. The history of productivity of the $\kappa$-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every … Continue reading
Posted in Partition Relations, Publications
Tagged Aronszajn tree, ccc, Fat stationary set, Minimal Walks, square, Weakly compact cardinal
2 Comments
