David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Logic, Language and Information 15 (1-2):49-63 (2006)
A bounded formula is a pair consisting of a propositional formula φ in the first coordinate and a real number within the unit interval in the second coordinate, interpreted to express the lower-bound probability of φ. Converting conjunctive/disjunctive combinations of bounded formulas to a single bounded formula consisting of the conjunction/disjunction of the propositions occurring in the collection along with a newly calculated lower probability is called absorption. This paper introduces two inference rules for effecting conjunctive and disjunctive absorption and compares the resulting logical system, called System Y, to axiom System P. Finally, we demonstrate how absorption resolves the lottery paradox and the paradox of the preference.
|Keywords||probabilistic logic rational acceptance the lottery paradox System P bounded uncertain reasoning|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Arthur Paul Pedersen & Gregory Wheeler (2014). Demystifying Dilation. Erkenntnis 79 (6):1305-1342.
Similar books and articles
Ken Akiba (2009). A New Theory of Quantifiers and Term Connectives. Journal of Logic, Language and Information 18 (3):403-431.
Gregory Wheeler (2005). On the Structure of Rational Acceptance: Comments on Hawthorne and Bovens. Synthese 144 (2):287 - 304.
Gregory Wheeler (2004). A Resource-Bounded Default Logic. In J. Delgrande & T. Schaub (eds.), Proceedings of NMR 2004. AAAI.
Thierry Denoeux (2008). Conjunctive and Disjunctive Combination of Belief Functions Induced by Nondistinct Bodies of Evidence. Artificial Intelligence 172 (2--3):234--264.
Greg Restall (2009). Not Every Truth Can Be Known (at Least, Not All at Once). In Joe Salerno (ed.), New Essays on the Knowability Paradox. Oxford University Press. 339--354.
Ross T. Brady (1993). Rules in Relevant Logic — II: Formula Representation. Studia Logica 52 (4):565 - 585.
R. E. Jennings (1994). The Genealogy of Disjunction. Oxford University Press.
R. E. Jennings (1994). The or of Free Choice Permission. Topoi 13 (1):3-10.
Added to index2009-01-28
Total downloads15 ( #156,293 of 1,696,585 )
Recent downloads (6 months)6 ( #95,693 of 1,696,585 )
How can I increase my downloads?