Getting more colors I
From MaRDI portal
Publication:4916539
DOI10.2178/JSL.7801010zbMATH Open1275.03136OpenAlexW2146632889MaRDI QIDQ4916539FDOQ4916539
Authors: Todd Eisworth 
Publication date: 23 April 2013
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jsl/1358951096
Recommendations
- Transforming rectangles into squares, with applications to strong colorings
- scientific article; zbMATH DE number 1795292
- scientific article; zbMATH DE number 4033728
- Negative partition relations for ordinals \(\omega^{\omega^\alpha}\)
- Partition relations for \(\kappa\)-normal ideals on \(P_{\kappa}(\lambda)\)
- Ordinary partition relations for ordinal numbers
- Partitioning pairs of countable sets of ordinals
- scientific article; zbMATH DE number 887756
- Aronszajn trees and partitions
- Cardinal characteristics of the continuum and partitions
Cites Work
- Title not available (Why is that?)
- Partitioning pairs of countable ordinals
- Notes on singular cardinal combinatorics
- Combinatorial set theory: Partition relations for cardinals
- Partition relations for cardinal numbers
- Successors of singular cardinals and coloring theorems II
- Club-guessing, stationary reflection, and coloring theorems
- A note on strong negative partition relations
Cited In (10)
- Complicated colorings, revisited
- STRONG COLORINGS OVER PARTITIONS
- A note on strong negative partition relations
- Two cardinal models for singular μ
- Transforming rectangles into squares, with applications to strong colorings
- Transformations of the transfinite plane
- On idealized versions of \(\mathrm{Pr}_1(\mu^+,\mu^+,\mu^+,\mathrm{cf}(\mu))\)
- Getting more colors. II
- Successors of singular cardinals and coloring theorems. I
- A proof of Shelah's partition theorem
This page was built for publication: Getting more colors I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916539)
