z-logo
Premium
Transitivity and Partial Screening Off
Author(s) -
Atkinson David,
Peijnenburg Jeanne
Publication year - 2013
Publication title -
theoria
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.34
H-Index - 16
eISSN - 1755-2567
pISSN - 0040-5825
DOI - 10.1111/j.1755-2567.2012.01148.x
Subject(s) - transitive relation , probabilistic logic , computer science , mathematics , combinatorics , artificial intelligence
Abstract: The notion of probabilistic support is beset by well‐known problems. In this paper we add a new one to the list: the problem of transitivity. T omoji S hogenji has shown that positive probabilistic support, or confirmation, is transitive under the condition of screening off. However, under that same condition negative probabilistic support, or disconfirmation, is intransitive. Since there are many situations in which disconfirmation is transitive, this illustrates, but now in a different way, that the screening‐off condition is too restrictive. We therefore weaken this condition to what we call ‘partial’ screening off. We show that the domain defined by partial screening off comprises two mutually exclusive subdomains. In one subdomain disconfirmation is indeed transitive, but confirmation is then intransitive. In the other, confirmation is transitive, but here disconfirmation is once more intransitive.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here