[2411.13500] Isomorphism Theorems between Models of Mixed Choice (Revised)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. arXiv Operational Status Get status notifications via email or slack
[2411.13500] Isomorphism Theorems between Models of Mixed Choice (Revised) Skip to main content arXiv is now an independent nonprofit! Learn more × Search arXiv Press Enter to search · Advanced search --> Computer Science > Logic in Computer Science arXiv:2411.13500 (cs) [Submitted on 6 Nov 2024 ( v1 ), last revised 27 Jun 2025 (this version, v2)] Title: Isomorphism Theorems between Models of Mixed Choice (Revised) Authors: Jean Goubault-Larrecq View a PDF of the paper titled Isomorphism Theorems between Models of Mixed Choice (Revised), by Jean Goubault-Larrecq View PDF HTML (exp
Explore this link on the map →related reading
- Arrow's impossibility theorem - Wikipediaen.wikipedia.org
- De Finetti's theorem - Wikipediaen.wikipedia.org
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- Towards a Research Program on Compositional World-Modeling – Topos Institutetopos.site
- Papers · Nikhil Garggargnikhil.com
- 2310.10631arxiv.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- 2510.01346arxiv.org
- Isomorphism theorems - Wikipediaen.wikipedia.org
- Logical decision theories — LessWrongarbital.com
- Frederic Koehlerfrkoehle.github.io
- Bryon Aragam // University of Chicagobryonaragam.com