Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
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-ZzbMATH Open1302.03039OpenAlexW2006362648MaRDI QIDQ484949FDOQ484949


Authors: Alexander R. Pruss Edit this on Wikidata


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

regularityprobabilityinfinitesimalsinfinity


Mathematics Subject Classification ID

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


Cites Work

  • Fair infinite lotteries
  • Title not available (Why is that?)
  • The extent of non-conglomerability of finitely additive probabilities
  • Reasoning to a Foregone Conclusion
  • Every real closed field has an integer part


Cited In (4)

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





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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484949)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:484949&oldid=12363703"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 04:59. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki