Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- James Hawthorne (2007). Nonmonotonic Conditionals That Behave Like Conditional Probabilities Above a Threshold. Journal of Applied Logic 5 (4):625-637.I’ll describe a range of systems for nonmonotonic conditionals that behave like conditional probabilities above a threshold. The rules that govern each system are probabilistically sound in that each rule holds when the conditionals are interpreted as conditional probabilities above a threshold level specific to that system. The well-known preferential and rational consequence relations turn out to be special cases in which the threshold level is 1. I’ll describe systems that employ weaker rules appropriate to thresholds lower than 1, and compare them to these two standard systems.
Similar books and articles
Mental probability logic is a psychological competence theory about how
humans interpret and reason about common-sense conditionals. Probability
logic is proposed as an appropriate standard of reference for evaluating the rationality
of human inferences. Common-sense conditionals are interpreted as
“high” conditional probabilities, P(B|A) > .5. Probability logical accounts
of nonmonotonic reasoning and inference rules like the modus ponens are
explored. Categorical syllogisms with comparative and quantitative quantifiers
are investigated. A series of eight experiments on human probabilistic
reasoning in the framework of the basic nonmonotonic system p corroborate
the psychological plausibility of the proposed approach.
We show that the implicational fragment of intuitionism is the weakest logic with a non-trivial probabilistic semantics which satisfies the thesis that the probabilities of conditionals are conditional probabilities. We also show that several logics between intuitionism and classical logic also admit non-trivial probability functions which satisfy that thesis. On the other hand, we also prove that very weak assumptions concerning negation added to the core probability conditions with the restriction that probabilities of conditionals are conditional probabilities are sufficient to trivialize the semantics.
A conditional takes the form ‘If A, then C’. On the truth-conditional view of conditionals, conditional statements state things with truth-conditions. On the suppositional view, conditional statements involve the expression of a supposition. I develop and defend a view on which conditional statements both state things with truth-conditions and express suppositions. On this view, something is fundamentally right about standard truth-conditional and standard suppositional views. Considerations in favor of conditional contents lead us to attribute truth-conditional contents to conditional statements; considerations in favor of the suppositional view then lead us to an unexpected account of these contents. The resulting view has a number of benefits, including a unified treatment of conditional speech acts, a plausible account of our practice of ascribing truth-values to conditional statements, a simple explanation of the apparent equivalence between probabilities of conditionals and conditional probabilities, an intuitive treatment of ‘Gibbardian stand-offs’, a plausible logic of conditionals, and an explanation of why theorizing about conditionals has proved so difficult.
This paper discusses counterexamples to the thesis that the probabilities of conditionals are conditional probabilities. It is argued that the discrepancy is systematic and predictable, and that conditional probabilities are crucially involved in the apparently deviant interpretations. Furthermore, the examples suggest that such conditionals have a less prominent reading on which their probability is in fact the conditional probability, and that the two readings are related by a simple step of abductive inference. Central to the proposal is a distinction between causal and purely stochastic dependence between variables.
The aim of the paper is to draw a connection between a semantical theory of conditional statements and the theory of conditional probability. First, the probability calculus is interpreted as a semantics for truth functional logic. Absolute probabilities are treated as degrees of rational belief. Conditional probabilities are explicitly defined in terms of absolute probabilities in the familiar way. Second, the probability calculus is extended in order to provide an interpretation for counterfactual probabilities--conditional probabilities where the condition has zero probability. Third, conditional propositions are introduced as propositions whose absolute probability is equal to the conditional probability of the consequent on the antecedent. An axiom system for this conditional connective is recovered from the probabilistic definition. Finally, the primary semantics for this axiom system, presented elsewhere, is related to the probabilistic interpretation.
The conditional probability of h given e is commonly claimed to be equal to the probability that h would have if e were learned. Here I contend that this general claim about conditional probabilities is false. I present a counter-example that involves probabilities of probabilities, a second that involves probabilities of possible future actions, and a third that involves probabilities of indicative conditionals. In addition, I briefly defend these counter-examples against charges that the probabilities they involve are illegitimate.
Adams' famous thesis that the probabilities of conditionals are conditional probabilities is incompatible with standard probability theory. Indeed it is incompatible with any system of monotonic conditional probability satisfying the usual multiplication rule for conditional probabilities. This paper explores the possibility of accommodating Adams' thesis in systems of non-monotonic probability of varying strength. It shows that such systems impose many familiar lattice theoretic properties on their models as well as yielding interesting logics of conditionals, but that a standard complementation operation cannot be defined within them, on pain of collapsing probability into bivalence.
Nonmonotonic conditionals (A |∼ B) are formalizations of common sense expressions of the form “if A, normally B”. The nonmonotonic conditional is interpreted by a “high” coherent conditional probability, P(B|A) > .5. Two important properties are closely related to the nonmonotonic conditional: First, A |∼ B allows for exceptions. Second, the rules of the nonmonotonic system p guiding A |∼ B allow for withdrawing conclusions in the light of new premises. This study reports a series of three experiments on reasoning with inference rules about nonmonotonic conditionals in the framework of coherence. We investigated the cut, and the right weakening rule of system p. As a critical condition, we investigated basic monotonic properties of classical (monotone) logic, namely monotonicity, transitivity, and contraposition. The results suggest that people reason nonmonotonically rather than monotonically. We propose nonmonotonic reasoning as a competence model of human reasoning.
In a previous paper I described a range of nonmonotonic conditionals that behave like conditional probability functions at various levels of probabilistic support. These conditionals were defined as semantic relations on an object language for sentential logic. In this paper I extend the most prominent family of these conditionals to a language for predicate logic. My approach to quantifiers is closely related to Hartry Field''s probabilistic semantics. Along the way I will show how Field''s semantics differs from a substitutional interpretation of quantifiers in crucial ways, and show that Field''s approach is closely related to the usual objectual semantics. One of Field''s quantifier rules, however, must be significantly modified to be adapted to nonmonotonic conditional semantics. And this modification suggests, in turn, an alternative quantifier rule for probabilistic semantics.
I will describe the logics of a range of conditionals that behave like conditional probabilities at various levels of probabilistic support. Families of these conditionals will be characterized in terms of the rules that their members obey. I will show that for each conditional, , in a given family, there is a probabilistic support level r and a conditional probability function P such that, for all sentences C and B, C->B holds just in case P[B|C] is greater than or equal to r. Thus, each conditional in a given family behaves like conditional probability above some specific support level.
Discussion of James Hawthorne, Nonmonotonic Conditionals that Behave Like Conditional Probabilities Above a Threshold
|
|
There are no threads in this forum |
Nothing in this forum yet.

