Was Ulam right? I: basic theory and subnormal ideals

DOI10.1016/j.topol.2022.108287OpenAlexW4304783971MaRDI QIDQ2105048

Assaf Rinot, Tanmay Inamdar

Publication date: 8 December 2022

Published in: Topology and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.05136

zbMATH Keywords

partition relationsweakly compact cardinalineffable cardinalUlam matrixsaturated idealsnegative partition relationSierpinski's onto mapping

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55) Partition relations (03E02)

Related Items (3)

Sums of triples in Abelian groups ⋮ KNASTER AND FRIENDS III: SUBADDITIVE COLORINGS ⋮ Was Ulam right? II: Small width and general ideals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Squares and covering matrices
• Colouring and non-productivity of \(\aleph_ 2\)-c.c
• Partitioning pairs of countable ordinals
• Knaster and friends. I: Closed colorings and precalibers
• Complicated colorings
• Walks on ordinals and their characteristics
• A microscopic approach to Souslin-tree constructions. I.
• Set theory. Exploring independence and truth
• Some counterexamples in the partition calculus
• A microscopic approach to Souslin-tree construction. II
• CHAIN CONDITIONS OF PRODUCTS, AND WEAKLY COMPACT CARDINALS
• Successors of Singular Cardinals
• Elementary embeddings and infinitary combinatorics
• The nonstationary ideal in the ℙ_max extension
• Saturated ideals
• Square bracket partition relations in L
• Simultaneous stationary reflection and square sequences
• Set Theory
• Rectangular square-bracket operation for successor of regular cardinals
• Transformations of the transfinite plane
• Knaster and friends II: The C-sequence number
• STRONG COLORINGS OVER PARTITIONS
• Ramsey theory over partitions III: Strongly Luzin sets and partition relations
• Partitioning a reflecting stationary set
• THE ONTO MAPPING OF SIERPINSKI AND NONMEAGER SETS
• Distributive Aronszajn trees
• On the complete subgraphs of graphs defined by systems of sets
• Partition relations for cardinal numbers
• From accessible to inaccessible cardinals (Results holding for all accessible cardinal numbers and the problem of their extension to inaccessible ones)
• The fine structure of the constructible hierarchy

This page was built for publication: Was Ulam right? I: basic theory and subnormal ideals