2007
DOI: 10.1016/j.jal.2006.03.014
|View full text |Cite
|
Sign up to set email alerts
|

Conditionals and consequences

Abstract: We examine the notion of conditionals and the role of conditionals in inductive logics and arguments. We identify three mistakes commonly made in the study of, or motivation for, non-classical logics. A nonmonotonic consequence relation based on evidential probability is formulated. With respect to this acceptance relation some rules of inference of System P are unsound, and we propose refinements that hold in our framework.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2007
2007
2012
2012

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 21 publications
(12 citation statements)
references
References 29 publications
0
12
0
Order By: Relevance
“…This idea is mooted by Kyburg, Teng, and Wheeler [12], but we can go further. We get another connection, this time between the family P and a family weaker than O that has appeared in the literature on several occasions under various names.…”
Section: Observation 33mentioning
confidence: 99%
“…This idea is mooted by Kyburg, Teng, and Wheeler [12], but we can go further. We get another connection, this time between the family P and a family weaker than O that has appeared in the literature on several occasions under various names.…”
Section: Observation 33mentioning
confidence: 99%
“…The properties of reasoning with such extreme probability statements were studied in [1,39,44] and turned out to be the properties of nonmonotonic reasoning laid bare in System P. In fact, the calculus of infinitesimal conditional probabilities of this form is equivalent to System P [7,39]. And degraded forms of inference rules of System P hold with standard conditional probabilities [23,27,38]. Remark 5 The above setting for plausible inference has been challenged on the ground that it conflicts with the idea of acceptance viewed as high probability: if in a given context Pr(A) and Pr(B) are close to 1, then it does not imply that Pr(AB) is close to 1 at all.…”
Section: Proposition 3 In System P If B |∼ K a Then Ab |∼ K C If Anmentioning
confidence: 99%
“…Remark 5 The above setting for plausible inference has been challenged on the ground that it conflicts with the idea of acceptance viewed as high probability: if in a given context Pr(A) and Pr(B) are close to 1, then it does not imply that Pr(AB) is close to 1 at all. It questions the deductive closure of accepted beliefs [38,48]. This is the basis of the lottery paradox of Kyburg [37] (buying a lottery ticket that loses is very likely, but one is sure that there is at least one winner).…”
Section: Proposition 3 In System P If B |∼ K a Then Ab |∼ K C If Anmentioning
confidence: 99%
“…The more you can say, the less you can do. Non-logical problem domainssuch as natural language-compound this problem because they very often are much richer than even the most expressive formal languages [16,27]. Hence, in nearly all applications of logic, one must select what features of the problem domain to represent within the framework and what features to ignore.…”
Section: On the Application Of Logicmentioning
confidence: 99%
“…For instance, there are good reasons to think that classical statistical inference forms do not satisfy the [And], [Or], and [Cautious Monotonicity] axioms of System P [16]. And there are logically interesting probabilistic logics that are weaker than System P. Among the weakest systems is System Y [34], which is built from 1-monotone capacities but nevertheless preserves greatest lower bound interval estimates on particular sequences of joins and meets of probabilistic events.…”
Section: System P and Aggregationmentioning
confidence: 99%