Synthese 146 (1-2):153 - 169 (2005)

Abstract
We present new probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment, called Zλ- and lexλ-entailment, which are parameterized through a value λ ∈ [0,1] that describes the strength of the inheritance of purely probabilistic knowledge. In the special cases of λ = 0 and λ = 1, the notions of Zλ- and lexλ-entailment coincide with probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment that have been recently introduced by the author. We show that the notions of Zλ- and lexλ-entailment have similar properties as their classical counterparts. In particular, they both satisfy the rationality postulates of System P and the property of Rational Monotonicity. Moreover, Zλ-entailment is weaker than lexλ-entailment, and both Zλ- and lexλ-entailment are proper generalizations of their classical counterparts.
Keywords Philosophy   Philosophy   Epistemology   Logic   Metaphysics   Philosophy of Language
Categories (categorize this paper)
DOI 10.1007/s11229-005-9082-9
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 63,323
Through your library

References found in this work BETA

View all 12 references / Add more references

Citations of this work BETA

Defeasible Reasoning.Robert C. Koons - 2008 - Stanford Encyclopedia of Philosophy.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
65 ( #164,406 of 2,448,724 )

Recent downloads (6 months)
4 ( #178,140 of 2,448,724 )

How can I increase my downloads?

Downloads

My notes