Archives
Keywords
approachability ideal Erdos-Hajnal graphs Greatly Mahlo Absoluteness ZFC construction Successor of Singular Cardinal Universal Sequences higher Baire space Ramsey theory over partitions Countryman line Amenable C-sequence sap full tree Analytic sets Chromatic number Club Guessing Cardinal Invariants L-space stationary hitting projective Boolean algebra Poset free Boolean algebra Erdos Cardinal GMA Commutative cancellative semigroups Knaster Microscopic Approach Fast club Almost Souslin club_AD Mandelbrot set Hedetniemi's conjecture transformations Ineffable cardinal Cardinal function Fodor-type reflection Partition relations for trees Ulam matrix Almost countably chromatic Vanishing levels AIM forcing Subtle tree property Subadditive Almost-disjoint family Diamond-sharp O-space Filter reflection Closed coloring Commutative projection system Uniformly coherent Singular Density very good scale diamond star Open Access free Souslin tree Monotonically far Forcing S-Space Generalized Clubs Iterated forcing Strong coloring Forcing Axioms Antichain Rado's conjecture Martin's Axiom Local Club Condensation. Slim tree Knaster and friends Reduced Power Generalized descriptive set theory Ascending path Cohen real Lipschitz reduction Weakly compact cardinal Kurepa Hypothesis Sigma-Prikry Successor of Regular Cardinal unbounded function Hindman's Theorem specializable Souslin tree coloring number Interval topology on trees Aronszajn tree Large Cardinals Distributive tree Constructible Universe indecomposable filter Rainbow sets ccc polarized partition relation PFA square principles Strongly compact cardinal Hereditarily Lindelöf space Sakurai's Bell inequality Fat stationary set Entangled linear order HOD reflection principles Reflecting stationary set Chang's conjecture nonmeager set Square-Brackets Partition Relations super-Souslin tree perfectly normal Subnormal ideal Selective Ultrafilter Respecting tree Strongly Luzin set Intersection model Prikry-type forcing Uniformization Rock n' Roll middle diamond Parameterized proxy principle square Precaliber Axiom R stick Luzin set Sierpinski's onto mapping principle weak Kurepa tree Dowker space Postprocessing function Prevalent singular cardinals Jonsson cardinal Forcing with side conditions stationary reflection Coherent tree SNR Singular cardinals combinatorics strongly bounded groups b-scale C-sequence Diamond PFA(S)[S] xbox incompactness Partition Relations Was Ulam right? Foundations Small forcing OCA positive partition relation Singular cofinality P-Ideal Dichotomy Uniformly homogeneous Well-behaved magma Nonspecial tree regressive Souslin tree 54G20 weak diamond Diamond for trees Minimal Walks tensor product graph countably metacompact Ostaszewski square Whitehead Problem Souslin Tree weak square Ascent Path Subtle cardinal Dushnik-Miller Non-saturation Shelah's Strong Hypothesis
Author Archives: Assaf Rinot
Forcing and its Applications Retrospective Workshop, April 2015
I gave an invited talk at Forcing and its Applications Retrospective Workshop, Toronto, April 1st, 2015. Title: A microscopic approach to Souslin trees constructions Abstract: We present an approach to construct $\kappa$-Souslin trees that is insensitive to the identity of … Continue reading
Posted in Invited Talks
Tagged Microscopic Approach, Parameterized proxy principle, Souslin Tree
Leave a comment
Putting a diamond inside the square
Abstract. By a 35-year-old theorem of Shelah, $\square_\lambda+\diamondsuit(\lambda^+)$ does not imply square-with-built-in-diamond_lambda for regular uncountable cardinals $\lambda$. Here, it is proved that $\square_\lambda+\diamondsuit(\lambda^+)$ is equivalent to square-with-built-in-diamond_lambda for every singular cardinal $\lambda$. Downloads: Citation information: A. Rinot, Putting a diamond inside … Continue reading
Posted in Publications, Squares and Diamonds
Tagged 03E05, 03E45, Diamond, square, Successor of Singular Cardinal
1 Comment
Generalizations of Martin’s Axiom and the well-met condition
Recall that Martin’s Axiom asserts that for every partial order $\mathbb P$ satisfying c.c.c., and for any family $\mathcal D$ of $<2^{\aleph_0}$ many dense subsets of $\mathbb P$, there exists a directed subset $G$ of $\mathbb P$ such that $G\cap … Continue reading
Posted in Blog, Expository
Tagged ccc, Forcing Axioms, GMA, Martin's Axiom, Uniformization
Leave a comment
Many diamonds from just one
Recall Jensen’s diamond principle over a stationary subset $S$ of a regular uncountable cardinal $\kappa$: there exists a sequence $\langle A_\alpha\mid \alpha\in S \rangle$ such that $\{\alpha\in S\mid A\cap\alpha=A_\alpha\}$ is stationary for every $A\subseteq\kappa$. Equivalently, there exists a sequence $\langle … Continue reading
Same Graph, Different Universe
Abstract. May the same graph admit two different chromatic numbers in two different universes? how about infinitely many different values? and can this be achieved without changing the cardinals structure? In this paper, it is proved that in Godel’s constructible … Continue reading
Posted in Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, approachability ideal, Chromatic number, Constructible Universe, Forcing, Ostaszewski square
10 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
Square principles
Since the birth of Jensen’s original Square principle, many variations of the principle were introduced and intensively studied. Asaf Karagila suggested me today to put some order into all of these principles. Here is a trial. Definition. A square principle … Continue reading
INFTY Final Conference, March 2014
I gave an invited talk at the INFTY Final Conference meeting, Bonn, March 4-7, 2014. [Curiosity: Georg Cantor was born March 3, 1845] Title: Same Graph, Different Universe. Abstract: In a paper from 1998, answering a question of Hajnal, Soukup … Continue reading
Partitioning the club guessing
In a recent paper, I am making use of the following fact. Theorem (Shelah, 1997). Suppose that $\kappa$ is an accessible cardinal (i.e., there exists a cardinal $\theta<\kappa$ such that $2^\theta\ge\kappa)$. Then there exists a sequence $\langle g_\delta:C_\delta\rightarrow\omega\mid \delta\in E^{\kappa^+}_\kappa\rangle$ … Continue reading
