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

Infinitesimals are too small for countably infinite fair lotteries

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

DOI10.1007/s11229-013-0307-zzbMath1302.03039OpenAlexW2006362648MaRDI QIDQ484949

Alexander R. Pruss

Publication date: 8 January 2015

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11229-013-0307-z


zbMATH Keywords

regularityprobabilityinfinityinfinitesimals


Mathematics Subject Classification ID

Probability and inductive logic (03B48) Nonstandard models in mathematics (03H05) Nonstandard measure theory (28E05)


Related Items (4)

How to build an infinite lottery machine ⋮ Probability modals and infinite domains ⋮ Underdetermination of infinitesimal probabilities ⋮ The qualitative paradox of non-conglomerability



Cites Work

  • Fair infinite lotteries
  • The extent of non-conglomerability of finitely additive probabilities
  • Every real closed field has an integer part
  • Reasoning to a Foregone Conclusion
  • Unnamed Item


This page was built for publication: Infinitesimals are too small for countably infinite fair lotteries

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:484949&oldid=12363703"
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 05:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki