PhilArchive
open access
Primitive conditional probabilities, subset relations and comparative regularity
Rational agents seem more confident in any possible event than in an impossible event. But if rational credences are real-valued, then there are some possible events that are assigned 0 credence nonetheless. How do we differentiate these events from impossible events then when we order events? de Finetti (1975), Hájek (2012) and Easwaran (2014) suggest that when ordering events, conditional credences and subset relations are as relevant as unconditional credences. I present a counterexample to all their proposals in this paper. While their proposals order possible and impossible events correctly, they deliver the wrong verdict for disjoint possible events assigned equal positive credence.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Counterfactual Dependence and Arrow#746328
- An Indexical Theory of Conditionals#776383
- Algebraic aspects and coherence conditions for conjoined and disjoined conditionals#736369
- Counterfactuals as Strict Conditionals#741374
- Epistemic Modal Credence#736878
Record · ID 699587
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive