Archives
Keywords
projective Boolean algebra Hindman's Theorem Non-saturation Open Access Selective Ultrafilter Prevalent singular cardinals Antichain Ulam matrix Closed coloring Fat stationary set Filter reflection middle diamond approachability ideal Forcing Knaster Generalized Clubs reflection principles unbounded function Greatly Mahlo Forcing Axioms weak square Reflecting stationary set Local Club Condensation. very good scale Kurepa Hypothesis GMA Subnormal ideal Nonspecial tree Small forcing Dushnik-Miller Absoluteness Fodor-type reflection incompactness Minimal Walks Almost countably chromatic Square-Brackets Partition Relations Successor of Regular Cardinal Almost-disjoint family Shelah's Strong Hypothesis P-Ideal Dichotomy Parameterized proxy principle Singular cardinals combinatorics Subadditive stationary reflection Martin's Axiom Hereditarily Lindelöf space Uniformly homogeneous 54G20 AIM forcing SNR club_AD Dowker space Uniformization Cardinal Invariants Club Guessing Sakurai's Bell inequality ZFC construction Uniformly coherent Weakly compact cardinal Partition Relations polarized partition relation ccc Prikry-type forcing square Amenable C-sequence Iterated forcing Intersection model Precaliber Cardinal function S-Space Was Ulam right? Constructible Universe free Boolean algebra Chang's conjecture stick PFA(S)[S] Knaster and friends square principles weak diamond Sigma-Prikry L-space Monotonically far Well-behaved magma sap positive partition relation Microscopic Approach indecomposable filter Rainbow sets strongly bounded groups Diamond-sharp Axiom R countably metacompact PFA b-scale Slim tree Fast club Universal Sequences Subtle tree property tensor product graph Successor of Singular Cardinal C-sequence Ineffable cardinal Commutative cancellative semigroups Postprocessing function Aronszajn tree Rock n' Roll nonmeager set Ostaszewski square Jonsson cardinal Cohen real Analytic sets Souslin Tree Ascent Path O-space free Souslin tree higher Baire space Vanishing levels Diamond for trees Commutative projection system Countryman line Poset Sierpinski's onto mapping principle full tree Entangled family regressive Souslin tree Reduced Power Hedetniemi's conjecture specializable Souslin tree Distributive tree Chromatic number Strongly Luzin set Diamond super-Souslin tree Singular Density Generalized descriptive set theory diamond star Singular cofinality stationary hitting Luzin set xbox Erdos Cardinal Strongly compact cardinal Whitehead Problem transformations Mandelbrot set OCA Foundations Strong coloring Erdos-Hajnal graphs Almost Souslin Coherent tree Lipschitz reduction coloring number Rado's conjecture HOD Ramsey theory over partitions Large Cardinals Subtle cardinal Respecting tree weak Kurepa tree
Author Archives: Assaf Rinot
Chain conditions of products, and weakly compact cardinals
Abstract. The history of productivity of the
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
Complicated colorings
Abstract. If
Posted in Partition Relations, Publications
Tagged Minimal Walks, Open Access, Square-Brackets Partition Relations
2 Comments
MFO workshop in Set Theory, January 2014
I gave an invited talk at the Set Theory workshop in Obwerwolfach, January 2014. Talk Title: Complicated Colorings. Abstract: If
Walk on countable ordinals: the characteristics
In this post, we shall present a few aspects of the method of walk on ordinals (focusing on countable ordinals), record its characteristics, and verify some of their properties. All definitions and results in this post are due to Todorcevic. … Continue reading
Polychromatic colorings
These are lectures notes of two talks Dani Livne gave in our Infinite Combinatorics seminar. I did not take notes in real-time, hence, all possible mistakes here are due to myself. Recall that a function
Universal binary sequences
Notation. Write
Mathematics Colloquium, Bar-Ilan University, November 2013
I gave a colloquium talk at Bar-Ilan University on November 10, 2013. Title: Forcing as a tool to prove theorems Abstract: Paul Cohen celebrated solution to Hilbert’s first problem showed that the Continuum Hypothesis is independent of the usual axioms of … Continue reading
