# Entailment with near surety of scaled assertions of high conditional probability

Journal of Philosophical Logic 29 (1):1-74 (2000)
 Abstract An assertion of high conditional probability or, more briefly, an HCP assertion is a statement of the type: The conditional probability of B given A is close to one. The goal of this paper is to construct logics of HCP assertions whose conclusions are highly likely to be correct rather than certain to be correct. Such logics would allow useful conclusions to be drawn when the premises are not strong enough to allow conclusions to be reached with certainty. This goal is achieved by taking Adams' (1966) logic, changing its intended application from conditionals to HCP assertions, and then weakening its criterion for entailment. According to the weakened entailment criterion, called the Criterion of Near Surety and which may be loosely interpreted as a Bayesian criterion, a conclusion is entailed if and only if nearly every model of the premises is a model of the conclusion. The resulting logic, called NSL, is nonmonotonic. Entailment in this logic, although not as strict as entailment in Adams' logic, is more strict than entailment in the propositional logic of material conditionals. Next, NSL was modified by requiring that each HCP assertion be scaled; this means that to each HCP assertion was associated a bound on the deviation from 1 of the conditional probability that is the subject of the assertion. Scaling of HCP assertions is useful for breaking entailment deadlocks. For example, it it is known that the conditional probabilities of C given A and of - C given B are both close to one but the bound on the former's deviation from 1 is much smaller than the latter's, then it may be concluded that in all likelihood the conditional probability of C given A ∧ B is close to one. The resulting logic, called NSL-S, is also nonmonotonic. Despite great differences in their definitions of entailment, entailment in NSL is equivalent to Lehmann and Magidor's rational closure and, disregarding minor differences concerning which premise sets are considered consistent, entailment in NSL-S is equivalent to entailment in Goldszmidt and Pearl's System-Z⁺. Bacchus, Grove, Halpern, and Koller proposed two methods of developing a predicate calculus based on the Criterion of Near Surety. In their randomstructures method, which assumed a prior distribution similar to that of NSL, it appears possible to define an entailment relation equivalent to that of NSL. In their random-worlds method, which assumed a prior distribution dramatically different from that of NSL, it is known that the entailment relation is different from that of NSL Keywords nonmonotonic logic  nonmonotonic reasoning  entailment  conditional probability  second-order probability  Bayesian inference  conditionals  rule-based systems  exceptions Categories (categorize this paper) Reprint years 2004 DOI 10.1023/A:1004650520609 Options Save to my reading list Follow the author(s) My bibliography Export citation Edit this record Mark as duplicate Request removal from index
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,651

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)
References found in this work BETA
Learning the Impossible.Vann McGee - 1994 - In Ellery Eells & Brian Skyrms (eds.), Probability and Conditionals: Belief Revision and Rational Decision. Cambridge University Press. pp. 179-199.
Citations of this work BETA
Similar books and articles
Neighborhoods for Entailment.Lou Goble - 2003 - Journal of Philosophical Logic 32 (5):483-529.
Entailment and Bivalence.Fred Seymour Michael - 2002 - Journal of Philosophical Logic 31 (4):289-300.
Foundational Issues in Presupposition.Mandy Simons - 2006 - Philosophy Compass 1 (4):357–372.
On Generalizing Kolmogorov.Richard Dietz - 2010 - Notre Dame Journal of Formal Logic 51 (3):323-335.

### Added to index

2009-01-28

53 ( #98,756 of 2,169,384 )