# Rational Acceptance and Conjunctive/Disjunctive Absorption

Two distinct features of the Keynes-Kyburg conception of probability are: (i) probability represents a logical relation that is objective, and (ii) not all probabilities are comparable. The non-comparability of probability is the starting point for this work in progress, which is a study of conjunction and disjunction for rationally accepted propositions understood to be an event’s lower probability. An abstract appears below the fold. Comments welcome!

Abstract: A bounded formula (φ, e) is a pair consisting of a propositional formula φ in the first coordinate and a real number within the unit interval in the second coordinate, interpreted to express that e is the lower-bound probability of φ. Converting conjunctive/disjunctive combinations of bounded formulas to a single bounded conjunctive/disjunctive proposition consisting of the propositions occuring in the collection of bounded formulas along with a newly calculated lower probability is called absorption. This paper introduces two inference rules for effecting conjunctive and disjunctive absorption and discusses their applicability to the lottery paradox and the paradox of the preface.

#### Rational Acceptance and Conjunctive/Disjunctive Absorption — 9 Comments

1. Greg,

Pretty interesting paper (though I confess I’m still getting my head around it). Is it fair to say that your core suggestion on solving the paradoxes is that there’s no inconsistency in asserting the following three propositions simultaneously: 1) “the probabilty that -p is true is above theta,”; 2) “the probability that -q is true is above theta,” and 3) “the probability that p or q is true is above theta” (where theta is the threshold for rational acceptance)?

Is it fair to say also that your proposal still does not completely reconcile the first and third legislative principles you identify for rational acceptance?

Are you familiar at all with Cohen’s book, the Probable and the Provable? He develps a nonstandard probability calculus in which the probabiilty of a conjunction is equal to its least probable conjunct. This obviosuly isn’t what you’re doing (and his approach seems rather to invite than to solve the paradoxes). Still there is some overlap in the spirit of your approaches in the sense that (to the extent I understand you correctly) you recognize that the first and third legislative principles can be reconciled only to the extent that there is some way of controlling the probability bleed off that results when two propositions are conjoined.

2. Hi Stephen,

Thanks for your comments. I do think that I’m committed to your propositions 1, 2, and 3 in the following sense: if p is bounded above the threshold point for acceptance Î¸ and q is also bounded above the threshold point for acceptance Î¸, then p or q is bounded above the threshold point for acceptance Î¸, since, by DA, the min of either of these probabilities is, by hypothesis, above Î¸. This would not hold for conjunction, however: a conjunction of two accepted propositions need not yield a rationally acceptable conjunction.

W.r.t. the main idea of the approach: I’m not sure that the disjunction rule is the core of the approach. I like the idea of performing resolution with absorbed clauses, which is why I included a disjunction rule that allows me to build clauses (since I don’t have negation for bounded formulas). I haven’t thought through this idea much beyond what I’ve written in the paper, however. It might be completely crackers.

W.r.t. Cohen: I agree that the proposal you sketch, applied to my project, would invite the paradoxes.

W.r.t. complete reconciliation of principles for rational acceptance 1 and 3: There is more work to be done on the approach I’ve sketched, certainly. For instance, I think there is an interesting difference between inner/outer measures and lower/upper probabilities that I’d like to study. One difference appears to concern monotonicity properties: inner measures are induced on a single (gappy) probability space, and so have nice monotonicity properties, whereas upper/lower measures, being sets of probabilities, are aggregates of measures. Hence, viewing the matter in terms of sets of probability measures, you might come along with fantastic new evidence for a proposition (a new experiment, rooted in a different probabilistic model that puts your proposition way, way above threshold, say) that allows its conjunction with some other propositions you accept. This scenario appears to be blocked by the inner/outer measure idea as I’ve used it here, since measures used to induce the inner probability of a statement is fixed.

Nevertheless, I am committed to the basic idea here for how we should expect conjunction and disjunction to behave for rationally accepted propositions. The comment I just mentioned about upper/lower probability seems to introduce a wrinkle in how to understand the downward monotonic preservation of lower probability, which I want[ed] to bracket and set aside for another time.

I should add, too, that I’m not too troubled by not having negation for bounded formulas nor troubled by not allowing conditional bounded formulas. One reason is that a negated bounded formula is ambiguous: it could express that a proposition is not bounded by e, but rather by some other value that is (a) greater than e or (b) less than e; or it could express (c) that we’ve no probabilistic data with respect to that proposition’s bound whatsoever. I don’t worry too much about not have a language to express conditional accepted propositions because it seems ill-advised to saddle the view with a particular semantics for conditionals at this stage. (Indeed, it might be nice to see what we can do while forgetting about conditionals altogether.)

Cheers, Greg

3. Hi Greg,

This is going to be a short note that, I fear, will come at your last post somewhat obliquely and won’t do it justice.

Many non-formal epistemologists want to understand your first legislative principle (that it is rational to accept a proposition that is very probably true) in terms of a “rule of detachment” that has two properties. The first (less interesting) property is simply that the rule allows one to infer a “full” belief from probabilistic evidence. The second (more interesting) property is that rule (as the name implies) “detaches” the inferred belief from that evidence in the sense that, once inferred, the belief carries no essential reference to the fact the evidence underlying it offered only probabilistic support.

These same epistemologists regard the third legislative principle as simply a reflection of this same “detachment” property. If the belief, once inferred, carries no essential referrence to the probabilistic character of the evidence from which one inferred it, then what would be the obstacle to conjoining it with a second belief simillarly inferred?

I take it that your approach in terms of bounded formulas rejects any such rule of detachment, since bounded formulas always are tagged with a lower bound probability.

I think this actually gets into a rather deep question about human reasoning — whether each inference records the level of support that the conclusion receives from its evidence (which in turn constrains the use of that conclusion in later inferences), or whether instead each inferential stage is, at were, opaque to the degree of support that attaches to prior stages.

4. Stephen,

Thank you very much for your comments. I am particularly interested in the epistemology underneath this proposal, so your observations are most welcome. My reply, in short, is that I would be inclined to reject the strong detachment thesis that you describe.

But I’m not sure that doing so should be a depressing option for traditional epistemologists who might understandably be attracted to the thesis you describe. We can apply logic to beliefs that we accept with probabilistic support to get other beliefs that are supported as well. But, we should take caution when we start stringing together things we accept, leaving to one side a priori warranted propositions for the sake of the argument. Roughly put, accepting p and accepting q is good but not conclusive reason for accepting p and q. A logic for rational acceptance should tell you those non-trivial cases in which acceptance of the conjunction is entailed by the acceptance of each conjunct and tell you about the cases where what you should do is go look for more evidence for the joint belief you’d like to entertain. In the latter case, perhaps what one has is a hypothesis or conjecture that has some prima facie reason acceptance only. Note that both cases would nevertheless be defeasible (in the non-trivial case where theta is less than 1).

A second thought on detachment: I have played around with an idea that allowed one to treat a set of accepted statements as all on par in ‘A resource bounded default logic’ (NMR 2004). But, since I start with bounded formulas it seems like I’m throwing away perfectly good information in order to get a set of propositions. This might not be so bad if, for instance, you are just interested in whether a particular set of formulas is non-monotonically derivable above some threshold point. But tossing out this information completely seems to weaken iterative inference since, then, the only reasonable thing to do would be to assign the threshold value to all beliefs in that class. In most cases you would weaken your hand by doing this. (I should add, however, that the semantics for statistical default logic is flexible enough to select the ‘best-bound’ for a proposition, if there happens to be more than one. Currently, we do this with Answer Set Semantics in an ‘Implementation of SDL’ that Carlos Damasio and I did appearing in JELIA 2004.)

I am not too worried about the book keeping issue, either, although I can see how a critic might make mischief here. I’m not claiming that we’ve numbers in our heads; Indeed, I find the idea that we actually have degrees of belief as persuasive as thinking that planets are actually point masses: it is to confuse the map for the terrain. Rather, giving an account that tells us, more precisely, why and when justification *may* degrade offers us the prospect of providing a good reason for when we– ordinary but otherwise rational human beings–are warranted in being suspicious of a long but otherwise valid argument involving empirical premises that we accept and, perhaps more importantly, when we are not warranted in being suspicious of a complicated but otherwise valid empirical argument. It would seem that fallibilism, if we’re to take the thesis seriously as a positive thesis, demands a positive account of how reasoning errs–not just how *we* err due to our psychological quirks of being homo sapiens, although I think that it is important also, but due to the more general problem of reasoning with uncertain representations of a domain.

I am committed to this rough picture. My project then is to explore the feasibility of modeling this conception of acceptance measure-theoretically, which is how I understand what it means to be committed to the first legislative principle.

5. I agree with you that the strong detachment thesis (accepting both the first and second properties) is dubious as an epistemic norm and implausible as a description of human inference. But I do think this thesis tends to get taken for granted in many epistemological discussions. Or rather, I think many epistemologists assume that the first property entails the second. You are right to separate them.

I also agree with you that an adequate theory of human inference has to explain when (and why) it is appropriate to string together things we accept (if I may borrow your phrase), and when it isn’t. My own intuitive sense is that coherence or explanatory integration plays a role here (the permissible length of the string is related to its degree of integration, or something like that), but I confess I have made little effort to develop that idea.

I would be interested to hear more about how your bounded formula approach connects with the non-comparability issue.

6. Hi Steve,

My previous comment was truncated: I still don’t quite understand what fragment of HTML the comments script accepts, since it will preview HTML correctly but will not always post HTML correctly, and it makes a total mess of Word .doc files by the looks of how ‘ and ” are rendered in some posts. I had thought of putting together a guide for people composing replies with dreaded Word –the key thing is to save your document as unicode (.txt)–but I don’t know what mark-up language we’re working with here since I write everything here in HTML and still get buggy posts. (Although the truncation problem looks like it was my fault…)

Ah, right: Non-comparability. Let me try a historical run at it. I’m cribbing here from a neat little paper of Kyburg’s, Journal of Applied Logic 1(2003): 139-149. Keynes had this idea that probability was an objective relation–objective in the sense that relations in a logical language are objective. Probability is not, he insisted ‘subject to human caprice. A proposition is not probable because we think it so. When once the facts are given which determine our knowledge, what is probable or improbable in these circumstances has been fixed objectively, and is independent of our opinion…When we argue that Darwin gives valid grounds for our accepting his theory of natural selection, we do not simply mean that we are psychologically inclined to agree with him; it is certain that we also intend to convey our belief that we are acting rationally in regarding his theory as probable. We believe that there is some real objective relation between Darwin’s evidence and his conclusions…'[Keynes A Treatise on Probability, 4-5]

Now, Keynes does speak of ‘degrees of rational belief’, which invites one to question his commitment to objectivity. Nevertheless, he denies that all probabilities are capable of being compared–which would be a strange thing for a proto-subjectivist to hold. (cf. Ramsey). The example he cites is the insurance business and how an underwriter issues policies against almost any outcome. This practice, he writes, ‘shows no more than that many probabilities are greater or less than some numerical measure, not that they themselves are numerically definite [p. 22]…there are some pairs of probabilities between the members of which no comparison of magnitude is possible…[we are not always in the position] to say that the degree of our rational belief in one conclusion is either equal to, greater than, or less than our degree of belief in another [p.34].

The short of it is that if you view evidential probability as an objective relation, then it is natural to view probabilities as not necessarily being comparable: just because you have a measure of an event P and a measure of an event Q doesn’t mean that you’ve always a measure of the joint event PQ. A Bayesian would deny this. I would suggest that if the Bayesian was right, the experimental drug business (for one) would be a whole lot cheaper. (Or if you want to insist on the metaphysics here, then the search problem becomes relevant and complexity issues are a real problem and not a minor technical issue.)

This is the underlying historical motivation for working with imprecise probabilities. What I’m interested in doing with bounded formulas is to show that there are properties of the measure that we can exploit to characterize bounds for conjunctive/disjunctive expressions, even if we haven’t a precise measure for each event.

Does that help?

7. Hi Greg,

If I understand you correctly, in your view the source of noncomparability lies in the fact that if all one knows is the lower bound probability of two propositions — (P,e) and (Q,e) — then, given only that information, there is no way to say which of P or Q is the more probable. All one can say is that each has a probability of at least e. This seems right.

About Keynes: it always seemed to me that there is a tension in his approach in that he marries objectivity with noncomparability. I guess that is because I always just assumed (rashly) that objectivity should entail determinateness, which in turn should entail comparability. My assumption was that if logicial probabilities are a matter of ratios among sets of possible worlds (not Keynes’ view, but a popular contemporary formulation), then intuitively these ratios ought to exist in every case, so that in principle one ought to be able to compare the probability of any two propositions on any given body of evidence.

On reflection, this does seem too rash an assumption. For example, it might be that one has to use different measures for different types of proposition. Thus, to assess the logical probability of P on E one might have to use measure M1, whereas measure M2 might be the “objectively correct” measure for assessing the probability of Q on E. One would have Prob(P/E) = M1(P&E)/M1(E) and Prob(Q/E) = M2(Q&E)/M2(E). In consequence, one couldn’t compare the probability of P on E with the probability of Q on E, even though these probabilities are each defined for their “correct” measures. Thus, as you suggest, while one has Prob(P/E) and Prob(Q/E), one doesn’t have Prob(P&Q/E).

However, this does raise a puzzle. If there is one “objectively correct” measure for one type of proposition and another “objectively correct” measure for another, how useful are logical probabilities for analyzing rational belief? What if you aren’t sure which measure is the right one to use in a given case? You’re pretty sure it’s measure M3 but it could also be M4 or M5. This suggests that you’d be forced to deal with epistemic probabilities about logical probabilities. And in that case, what good are the logical probabilities? Why not just use the epistemic probabilities if they’re independently defined? I realize this argument needs quite a bit of unpacking, but it think it does raise some interesting issues.

Steve

8. Steve,

Thanks for your excellent comments. I’m not sure how well I can address them, but I’ll give it a try.

My thoughts on bounded formula are influenced by how basic inferential statistical reasoning treats hypothesis testing. And I’ve extended this–building on work by Kyburg and Teng –to generalize basic forms of inferential statistical reasoning. Now I am working on extending this to model rational acceptance. My working conjecture is that statistical hypothesis testing is a special case of rational acceptance, namely the hyper-articulated case. The idea is that rough logical forms of statistical reasoning would give us a rough logical form of rational acceptance. One property of both is that confidence depletes. Let me look at hypothesis testing now to point out some other properties that might help in addressing your comments.

My favorite pedagogical example is Fisher’s tea testing example: A woman claims to have the ability to determine, by taste alone, whether milk was added first or last to her tea. The hypothesis we wish to test (Lady has the ability) may be evaluated by comparing her performance of correct classification (pre- or post-lactated tea) for a sequence of trials (cups of tea) to the probability of a similar number of correct classifications by chance. Suppose we set a trial of 5 cups and we plan to `accept’ that she has the ability if she correctly classifies all 5 cups, since she stands a 1/32 odds of picking the correct sequence by chance and this chance of error is, observing convention, less than 0.05. Suppose she does it: that is, she correctly classifies all 5. Does she have the ability to discriminate pre-lactated tea from post-lactated tea?

Well, this depends on whether the experiment was properly controlled. If she sat watching you prepare the cups, her classification wouldn’t be evidence for squat. So you might want to make sure that the samples are prepared out of her view, stirred properly, presented to her blindly by an assistant, that she wear a blindfold…this kind of thing. The point is, our confidence that she has the ability given her performance is based *not simply* on the distance of her performance (i.e., the sequence of 5 correct guesses) and the binomial probability of this sequence occurring (1/32), but that the experiment is sufficiently controlled so that this distance is reasonable enough evidence for us to think, yeah, she can do it. (I should note that ‘sufficiently’ controlled is a misnomer: these conditions are defeasible, in practice. Which brings in non-monotonicity…but let’s bracket this.)

I think that putting the matter in the Carnapian terms you suggested (para 3, post 7) masks this behavior that I’ve spelled out in Fisher’s example: For we would just start by saying that c(woman doesn’t have ability, 5 correct guesses) = 1/32, and move from there.

I’m reluctant to do this, since I think it completely fouls up the connection between probability and evidence. I think I understand the Tea-testing example and the role that my background knowledge plays in seeing that the experiment gives good evidence for my accepting the claim. I am inclined to see the confidence associated with rejecting the null hypothesis (one minus the probability of committing a type 2 error) as the lower-bound probability of accepting that, yes, the woman has the ability. I believe that a statistician would swallow the rough picture I’ve laid out so far, except the very last part about accepting the hypothesis that she has the ability. But, the defeasibility discussion I’ve bracketed is designed to address the thrust of this objection, as well. And, besides, I need some positive value to move around if I’m going to talk about how it a formal language for rational accepted propositions is supposed to behave.

(1) Are the probabilities in the Tea testing example ‘objective’? We’re comparing her performance to a theorem of the calculus of probabilities and what we know about the situation at hand to determine whether the salient properties of this theorem ‘apply’ to the case at hand. We are not selecting probabilities out of thin air; our goal, our intent, and our confidence in our evidence is predicated on this experiment showing that it would be astonishing to see these results if she were guessing.

(2) Are the probabilities in the Tea testing example ‘objective’?(!) I think that they are objective in this sense: if the experiment is properly controlled, then the confidence we assign to the claim that she can make the distinction is rooted in a fact about her performance and that we in fact stand a 1/32 chance of being wrong. Furthermore, if we do stand a chance greater than 1/32 of accepting that she can discriminate by taste but that she in fact cannot discriminate by taste, then the experiment is not well controlled or it is not well designed. I think there are facts to the matter that answer these questions, and that arguments over experimental results often are precisely about these factual matters. Some of these questions are settled in meetings; some by another experiment.

(3) Are the probabilities in the Tea testing example ‘objective’? (!!) I don’t know.

(4) What’s the use of this? Isn’t it just turtles all the way down? I think that it is useful to understand the components that go into rationally accepting a proposition. That is, what I’m after is a structure for rational accepted propositions that, when we’re working with such items and we’d like to manipulate them (conjoin, disjoin; close under consequence), we are provided with a better idea of how these various components are affected by those operations. That’s what logic does, after all.

Background knowledge is very important to selecting a reference class and for determining whether or not a particular experiment is well designed or, if well designed, whether it is properly controlled. This observation is what, in part, makes so-called inductive logic so messy: it pollutes the clean distinction between logical vocabulary and non-logical vocabulary that make formal languages, well, formal.

I’m realizing now, at the end of this, how rich your note is. I don’t think that I’ve even begun to address the substance of your points. It seems, rather, that what I’ve done is to try to motivate how I hope to address them–or avoid them, as the case may be.

Greg

9. Greg,

I agree with much of your last post, assuming I’ve understood it correctly.
(But I do wish my background allowed me to engage with your work more completely.)

I take your point re Carnap to be that the systems of inductive logic he explored were not “structured” in your sense. I think this is right. To put it in the simplest terms, measuring degree of confirmation in itself is not a theory of acceptance at all. A true theory of acceptance, it seems, must be structured in your sense. (Putting the point in the carnapian way as I did was not so much to endorse Carnap as simply to illustrate how probabilities might be objective, yet noncomparable.)

I actually think that your desire for a structured approach is related to the search for a “rule of detachment” that I mentioned earlier. A system of inductive logic based on a rule of detachment would be structured in your sense because it would allow for the syntactic manipulation of accepted propositions that you want to capture. But, as you point out, the rule of detachment in its strong form “throws away perfectly good information to get a set of propositions” and cannot account for depletion in confidence. Thus, your bounded formula approach is a way of trying to capture the virtues of that rule of without its drawbacks.