Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An introduction to infinite hat problems

From MaRDI portal
Publication:647139
Jump to:navigation, search

DOI10.1007/BF03038092zbMath1227.91008MaRDI QIDQ647139

Alan D. Taylor, Christopher S. Hardin

Publication date: 1 December 2011

Published in: The Mathematical Intelligencer (Search for Journal in Brave)



Mathematics Subject Classification ID

Games with infinitely many players (91A07) Decision theory for games (91A35) Axiom of choice and related propositions (03E25)


Related Items

The aftermath ⋮ Borel combinatorics fail in HYP ⋮ Limit-like predictability for discontinuous functions ⋮ On transitive subrelations of binary relations



Cites Work

  • Can you take Solovay's inaccessible away?
  • Infinitary Jonsson algebras and partition relations
  • Retracted: Baire property and axiom of choice
  • A model of set-theory in which every set of reals is Lebesgue measurable
  • A Peculiar Connection Between the Axiom of Choice and Predicting the Future
  • Hat Guessing Games
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:647139&oldid=12547636"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 09:48.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki