On transitive subrelations of binary relations

DOI10.2178/jsl/1318338858zbMath1246.03065OpenAlexW2152776432MaRDI QIDQ3107363

Christopher S. Hardin

Publication date: 23 December 2011

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1318338858

zbMATH Keywords

transitive relationpartition relationhat problemthick relation

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Other classical set theory (including functions, relations, and set algebra) (03E20)

Cites Work

• Unnamed Item
• An introduction to infinite hat problems
• Combinatorial set theory: Partition relations for cardinals
• Structure of transitive valued binary relations
• A method for obtaining transitive approximations of a binary relation
• Limit-like predictability for discontinuous functions
• Minimal predictors in hat problems
• Hat Guessing Games

This page was built for publication: On transitive subrelations of binary relations