Uniforming n-place functions on ds(alpha)
Esther Gruenhut, Saharon Shelah
TL;DR
This paper generalizes the Erdős-Rado theorem to well-founded trees, expanding its applicability in combinatorial set theory.
Contribution
It introduces a new generalization of the Erdős-Rado theorem specifically for well-founded trees.
Findings
Extended Erdős-Rado theorem to well-founded trees
Provided new combinatorial partition results
Enhanced understanding of tree structures in set theory
Abstract
In this paper the Erdos-Rado theorem is generalized to the class of well founded trees.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph theory and applications