The aim of the paper is to develop general criteria of argumentative validity and adequacy for probabilistic arguments on the basis of the epistemological approach to argumentation. In this approach, as in most other approaches to argumentation, proabilistic arguments have been neglected somewhat. Nonetheless, criteria for several special types of probabilistic arguments have been developed, in particular by Richard Feldman and Christoph Lumer. In the first part (sects. 2-5) the epistemological basis of probabilistic (...) class='Hi'>arguments is discussed. With regard to the philosophical interpretation of probabilities a new subjectivist, epistemic interpretation is proposed, which identifies probabilities with tendencies of evidence (sect. 2). After drawing the conclusions of this interpretation with respect to the syntactic features of the probability concept, e.g. one variable referring to the data base (sect. 3), the justification of basic probabilities (priors) by judgements of relative frequency (sect. 4) and the justification of derivative probabilities by means of the probability calculus are explained (sect. 5). The core of the paper is the definition of '(argumentatively) valid derivative probabilistic arguments', which provides exact conditions for epistemically good probabilistic arguments, together with conditions for the adequate use of such arguments for the aim of rationally convincing an addressee (sect. 6). Finally, some measures for improving the applicability of probabilistic reasoning are proposed (sect. 7). (shrink)

In this paper, we discuss three probabilistic arguments for the existence of multiple universes. First, we provide an analysis of total evidence and use that analysis to defend Roger White's "this universe" objection to a standard fine-tuning argument for multiple universes. Second, we explain why Rodney Holder's recent cosmological argument for multiple universes is unconvincing. Third, we develop a "Cartesian argument" for multiple universes. While this argument is not open to the objections previously noted, we show that, given (...) certain highly plausible assumptions about evidence and epistemic probability, the proposition which it treats as evidence cannot coherently be regarded as evidence for anything. This raises the question of whether to reject the assumptions or accept that such a proposition cannot be evidence. (shrink)

First I state and develop a probabilistic argument for the conclusion that theistic belief is irrational or somehow noetically improper. Then I consider this argument from the point of view of the major contemporary accounts of probability, Concluding that none of them offers the atheologian aid and comfort.

There is a generic way to add any new feature to a system. It involves identifying the basic units which build up the system and introducing the new feature to each of these basic units. In the case where the system is argumentation and the feature is probabilistic we have the following. The basic units are: the nature of the arguments involved; the membership relation in the set S of arguments; the attack relation; and the choice of (...) extensions. Generically to add a new aspect to an argumentation network \ can be done by adding this feature to each component. This is a brute-force method and may yield a non-intuitive or meaningful result. A better way is to meaningfully translate the object system into another target system which does have the aspect required and then let the target system endow the aspect on the initial system. In our case we translate argumentation into classical propositional logic and get probabilistic argumentation from the translation. Of course what we get depends on how we translate. In fact, in this paper we introduce probabilistic semantics to abstract argumentation theory based on the equational approach to argumentation networks. We then compare our semantics with existing proposals in the literature including the approaches by M. Thimm and by A. Hunter. Our methodology in general is discussed in the conclusion. (shrink)

Discussion among individuals about a given issue often induces polarization and bipolarization effects, i.e. individuals radicalize their initial opinion towards either the same or opposite directions. Experimental psychologists have put forward Persuasive Arguments Theory as a clue for explaining polarization. PAT claims that adding novel and persuasive arguments pro or contra the debated issue is the major cause for polarization. Recent developments in abstract argumentation provide the tools for capturing these intuitions on a formal basis. Here Bipolar Argumentation (...) Frameworks are employed as a tool for encoding the information of agents in a debate relative to a given issue a. A probabilistic extension of BAF allows to encode the likelihood of the opinions pro or contra a before and after information exchange. It is shown, by a straightforward example, how these measures provide the basis to capture the intuitions of PAT. (shrink)

The aim of this paper is to state the single most powerful argument for use of a non-classical logic in quantum mechanics. In outline the argument is the following. The working logic of a science is the logic of the events and propositions to which probabilities are assigned. A probability should be assigned to every element of the algebra of events. In the case of quantum mechanics probabilities may be assigned to events but not, without restriction, to the conjunction of (...) two events. The conclusion is that the working logic of quantum mechanics is not classical. The nature of the logic that is appropriate for quantum mechanics is examined. (shrink)

If the influence of libertarian free will on human behaviour is real, the frequency of certain freely chosen actions will differ from the probability of their occurrences deduced from the statistical calculations and neuroscientific observations and laws. According to D. Pereboom, contemporary science does not prove the efficacy of libertarian free will. According to P. van Inwagen, there is always a random element in free decisions, and hence the effect of the free will remains unknown. Swinburne observes that it is (...) not correct to conclude that libertarian free will has no causal effect in the physical world. One can only conclude that these choices are not neurologically real. People sometimes choose to act on abstract principles, and they can do so on a regular and long-term basis. Consequently, human behaviour can be predicted and explained in terms of personal agency and the reasons upon which the people have chosen to act. Probabilistic calculations strengthen the argument that the best way to explain and predict such rational behaviour is to affirm the efficacy of the libertarian free will, which can overcome neurophysiological motivational states of the body and which guarantees a kind of long-term rational determinism. (shrink)

In this article I investigate Rowe's recent probabilistic argument from evil. By using muddy Venn diagrams to present his argument, we see that although his argument is fallacious, it can be modified in a way that strengthens it considerably. I then discuss the recent exchange between Rowe and Plantinga over this argument. Although Rowe's argument is not an argument from degenerate evidence as Plantinga claimed, it is problematic because it is an argument from partitioned evidence. I conclude by discussing (...) the modified argument and the epistemic framework Rowe is assuming in his argument. (shrink)

1. The benefits resulting from a combination of quantitative (e.g. probabilistic) and qualitative (e.g. logic-based) reasoning are widely acknowledged (e.g. see Domingos et al., 2006; Poole, 2011)....

This paper offers a probabilistic treatment of the conditions for argument cogency as endorsed in informal logic: acceptability, relevance, and sufficiency. Treating a natural language argument as a reason-claim-complex, our analysis identifies content features of defeasible argument on which the RSA conditions depend, namely: change in the commitment to the reason, the reason’s sensitivity and selectivity to the claim, one’s prior commitment to the claim, and the contextually determined thresholds of acceptability for reasons and for claims. Results contrast with, (...) and may indeed serve to correct, the informal understanding and applications of the RSA criteria concerning their conceptual dependence, their function as update-thresholds, and their status as obligatory rather than permissive norms, but also show how these formal and informal normative approachs can in fact align. (shrink)

Probabilistic argumentation and neuro-argumentative systems offer new computational perspectives for the theory and applications of argumentation, but their principled construction involves two entangled problems. On the one hand, probabilistic argumentation aims at combining the quantitative uncertainty addressed by probability theory with the qualitative uncertainty of argumentation, but probabilistic dependences amongst arguments as well as learning are usually neglected. On the other hand, neuro-argumentative systems offer the opportunity to couple the computational advantages of learning and massive parallel (...) computation from neural networks with argumentative reasoning and explanatory abilities, but the relation of probabilistic argumentation frameworks with these systems has been ignored so far. Towards the construction of neuro-argumentative systems based on probabilistic argumentation, we associate a model of abstract argumentation and the graphical model of Boltzmann machines in order to (i... (shrink)

Four important arguments for probabilism—the Dutch Book, representation theorem, calibration, and gradational accuracy arguments—have a strikingly similar structure. Each begins with a mathematical theorem, a conditional with an existentially quantified consequent, of the general form: if your credences are not probabilities, then there is a way in which your rationality is impugned.Each argument concludes that rationality requires your credences to be probabilities.I contend that each argument is invalid as formulated. In each case there is a mirror-image theorem and (...) a corresponding argument of exactly equal strength that concludes that rationality requires your credences not to be probabilities. Some further consideration is needed to break this symmetry in favour of probabilism. I discuss the extent to which the original arguments can be buttressed.1. Introduction2. The Dutch Book Argument2.1. Saving the Dutch Book argument2.2. ‘The Dutch Book argument merely dramatizes an inconsistency in the attitudes of an agent whose credences violate probability theory’3. Representation Theorem-based Arguments4. The Calibration Argument5. The Gradational Accuracy Argument6. Conclusion. (shrink)

This paper develops a probabilistic reconstruction of the No Miracles Argument in the debate between scientific realists and anti-realists. The goal of the paper is to clarify and to sharpen the NMA by means of a probabilistic formalization. In particular, we demonstrate that the persuasive force of the NMA depends on the particular disciplinary context where it is applied, and the stability of theories in that discipline. Assessments and critiques of "the" NMA, without reference to a particular context, (...) are misleading and should be relinquished. This result has repercussions for recent anti-realist arguments, such as the claim that the NMA commits the base rate fallacy. It also helps to explain the persistent disagreement between realists and anti-realists. (shrink)

All else being equal, can granting the objective purport of moral experience support a presumption in favor of some form of moral objectivism? Don Loeb (2007) has argued that even if we grant that moral experience appears to present us with a realm of objective moral fact—something he denies we have reason to do in the first place—the objective purport of moral experience cannot by itself provide even prima facie support for moral objectivism. In this paper, I contend against Loeb (...) that granting the objective purport of ordinary moral experience is sufficient to support a defeasible presumption in favor of moral objectivism, and this by constituting non-explanatory, comparative confirmation that incrementally raises the prima facie likelihood that moral facts exist. More specifically, I appeal to a modest confirmation principle shared by Likelihoodists and Bayesieans - namely, the Weak Law of Likelihood - in an effort to show that (i) at a minimum, moral experience establishes a middling scrutable probability for a sufficient but not necessary condition of moral objectivism being true, and that (ii) this moderate probability in turn constitutes evidence that makes it prima facie more probable than not that some form of moral objectivism is true. (shrink)

This paper proposes an approach to investigate norm-governed learning agents which combines a logic-based formalism with an equation-based counterpart. This dual formalism enables us to describe the reasoning of such agents and their interactions using argumentation, and, at the same time, to capture systemic features using equations. The approach is applied to norm emergence and internalisation in systems of learning agents. The logical formalism is rooted into a probabilistic defeasible logic instantiating Dung’s argumentation framework. Rules of this logic are (...) attached with probabilities to describe the agents’ minds and behaviours as well as uncertain environments. Then, the equation-based model for reinforcement learning, defined over this probability distribution, allows agents to adapt to their environment and self-organise. (shrink)

Probabilism, the view that agents have numerical degrees of beliefs that conform to the axioms of probability, has been defended by the vast majority of its proponents by way of either of two arguments, the Dutch Book Argument and the Representation Theorems Argument. In this paper I argue that both arguments are flawed. The Dutch Book Argument is based on an unwarranted, ad hoc premise that cannot be dispensed with. The Representation Theorems Argument hinges on an invalid implication.

Both Representation Theorem Arguments and Dutch Book Arguments support taking probabilistic coherence as an epistemic norm. Both depend on connecting beliefs to preferences, which are not clearly within the epistemic domain. Moreover, these connections are standardly grounded in questionable definitional/metaphysical claims. The paper argues that these definitional/metaphysical claims are insupportable. It offers a way of reconceiving Representation Theorem arguments which avoids the untenable premises. It then develops a parallel approach to Dutch Book Arguments, and compares (...) the results. In each case preferencedefects serve as a diagnostic tool, indicating purely epistemic defects. (shrink)

James Joyce's 'Nonpragmatic Vindication of Probabilism' gives a new argument for the conclusion that a person's credences ought to satisfy the laws of probability. The premises of Joyce's argument include six axioms about what counts as an adequate measure of the distance of a credence function from the truth. This paper shows that (a) Joyce's argument for one of these axioms is invalid, (b) his argument for another axiom has a false premise, (c) neither axiom is plausible, and (d) without (...) these implausible axioms Joyce's vindication of probabilism fails. (shrink)

We present an interdisciplinary approach to study systematic relations between logical form and attacks between claims in an argumentative framework. We propose to generalize qualitative attack principles by quantitative ones. Specifically, we use coherent conditional probabilities to evaluate the rationality of principles which govern the strength of argumentative attacks. Finally, we present an experiment which explores the psychological plausibility of selected attack principles.

The Dutch Book Argument for Probabilism assumes Ramsey's Thesis (RT), which purports to determine the prices an agent is rationally required to pay for a bet. Recently, a new objection to Ramsey's Thesis has emerged (Hedden 2013, Wronski & Godziszewski 2017, Wronski 2018)--I call this the Expected Utility Objection. According to this objection, it is Maximise Subjective Expected Utility (MSEU) that determines the prices an agent is required to pay for a bet, and this often disagrees with Ramsey's Thesis. I (...) suggest two responses to Hedden's objection. First, we might be permissive: agents are permitted to pay any price that is required or permitted by RT, and they are permitted to pay any price that is required or permitted by MSEU. This allows us to give a revised version of the Dutch Book Argument for Probabilism, which I call the Permissive Dutch Book Argument. Second, I suggest that even the proponent of the Expected Utility Objection should admit that RT gives the correct answer in certain very limited cases, and I show that, together with MSEU, this very restricted version of RT gives a new pragmatic argument for Probabilism, which I call the Bookless Pragmatic Argument. (shrink)

I argue that in order to account for normative uncertainty, an expressivist theory of normative language and thought must accomplish two things: Firstly, it needs to find room in its framework for a gradable conative attitude, degrees of which can be interpreted as representing normative uncertainty. Secondly, it needs to defend appropriate rationality constraints pertaining to those graded attitudes. The first task – finding an appropriate graded attitude that can represent uncertainty – is not particularly problematic. I tackle the second (...) task by exploring whether we can devise expressivist versions of the standard arguments used to support rationality constraints on degrees of uncertainty, Dutch book arguments and accuracy-dominance arguments. I show that we can do so, but that the resulting arguments don’t support the same rationality constraints as the original versions of the arguments. (shrink)

Scoring rules measure the deviation between a credence assignment and reality. Probabilism holds that only those credence assignments that satisfy the axioms of probability are rationally admissible. Accuracy-based arguments for probabilism observe that given certain conditions on a scoring rule, the score of any non-probability is dominated by the score of a probability. The conditions in the arguments we will consider include propriety: the claim that the expected accuracy of _p_ is not beaten by the expected accuracy of (...) any other credence _c_ by the lights of _p_ if _p_ is a probability. I argue that if we think through how a non-probabilist can respond to pragmatic arguments for probabilism, we will expect the non-probabilist to accept a condition _stronger_ than propriety for the same reasons that the probabilist gives for propriety, but this stronger condition is incompatible with the other conditions that the probabilist needs to run the accuracy argument. This makes it unlikely for the probabilist’s argument to be compelling. (shrink)

Our reasoning evolved not for finding the truth, but for social bonding and convincing. This book highlights the consequences of these facts for scientific practice, and suggests how to correct the mistakes we still make.

The debate on probabilistic measures of coherence flourishes for about 15 years now. Initiated by papers that have been published around the turn of the millennium, many different proposals have since then been put forward. This contribution is partly devoted to a reassessment of extant coherence measures. Focusing on a small number of reasonable adequacy constraints I show that (i) there can be no coherence measure that satisfies all constraints, and that (ii) subsets of these adequacy constraints motivate two (...) different classes of coherence measures. These classes do not coincide with the common distinction between coherence as mutual support and coherence as relative set-theoretic overlap. Finally, I put forward arguments to the effect that for each such class of coherence measures there is an outstanding measure that outperforms all other extant proposals. One of these measures has recently been put forward in the literature, while the other one is based on a novel probabilistic measure of confirmation. (shrink)

In Probabilistic Knowledge Sarah Moss proposes that our credences and subjective probability judgments (SPJs) can constitute knowledge. Mossean probabilistic knowledge is grounded in probabilistic beliefs that are justified, true, and unGettiered. In this paper I aim to address and solve two challenges that arise in the vicinity of the factivity condition for probabilistic knowledge: the factivity challenge and the challenge from probabilistic arguments from ignorance (probabilistic AIs). I argue that while Moss's deflationary solution (...) to the factivity challenge formally works, it leaves us ill-equipped to handle probabilistic AIs. An account of probabilistic knowledge that cannot overcome probabilistic AIs makes knowledge of thoroughly probabilistic contents a rare and unstable phenomenon, at best, or, at worst, impossible. I hold that establishing a metaphysically enriched account of probabilistic truth is therefore mandatory. I go on to develop a truth-conditional approach on probabilistic factivity that is relativistic in its nature and centers on objective chances. I show that while the approach is still compatible with Moss's overall semantics for probabilistic knowledge, it provides us with a simple but forceful answer to probabilistic AIs. (shrink)

Probabilism is the view that a rational agent's credences should always be probabilistically coherent. It has been argued that Probabilism follows, given the assumption that an epistemically rational agent ought to try to have credences that represent the world as accurately as possible. The key claim in this argument is that the goal of representing the world as accurately as possible is best served by having credences that are probabilistically coherent. This essay shows that this claim is false. In certain (...) cases, the goal of having accurate credences is best served by being probabilistically incoherent. Assuming that an epistemically rational agent ought to try to have credences that are as accurate as possible, it follows that in certain cases a rational agent ought to have probabilistically incoherent credences. (shrink)

Cílem této práce je rozebrat možnosti argumentu holandské sázky ve prospěch probabilismu a stanovit jeho meze. Existuje mnoho podob argumentu, proto se nejprve budu věnovat popisu argumentu v jeho klasické podobě. Následně je podroben kritice ve třech oblastech: (1) problémy behaviorismu, (2) užitku peněz, (3) vztah koherence, jisté ztráty a racionality. Zásadní je dle mého především třetí oblast týkající se neschopnosti jednoduše propojit probabilistickou nekoherenci stupňů přesvědčení s jistou ztrátou a pragmatickou racionalitou. Věnuji se třem současným reinterpretacím argumentu ve prospěch (...) probabilistických norem (Armendt, Howson, Christensen), přičemž v textu docházím k závěru, že ani jedna z nich není uspokojivá. Selhávají v řešení problémů (Armendt, Christensen), nebo neříkají nic zajímavého ve prospěch probabilismu (Howson). Proto se domnívám, že rozbor argumentu především ukazuje, že pragmatická obhajoba epistemických norem racionality, jako je ta v argumentu holandské sázky, není pro probabilismus schůdnou cestou. Závěr se snaží nastínit, proč tomu tak je. (shrink)

In this paper I expound an argument which seems to establish that probabilism and special relativity are incompatible. I examine the argument critically, and consider its implications for interpretative problems of quantum theory, and for theoretical physics as a whole.

In a recent paper, Pettigrew reports a generalization of the celebrated accuracy-dominance theorem due to Predd et al., but Pettigrew’s proof is incorrect. I will explain the mistakes and provide a correct proof.

One of the main goals of Bayesian epistemology is to justify the rational norms credence functions ought to obey. Accuracy arguments attempt to justify these norms from the assumption that the source of value for credences relevant to their epistemic status is their accuracy. This assumption and some standard decision-theoretic principles are used to argue for norms like Probabilism, the thesis that an agent’s credence function is rational only if it obeys the probability axioms. We introduce an example that (...) shows that the accuracy arguments for Probabilism given by Joyce and Pettigrew fail, and that Probabilism in fact turns out to be false given Pettigrew’s way of conceiving of the goal of having accurate credences. Finally, we use our discussion of Pettigrew’s framework to draw an important general lesson about normative theorizing that relies on the positing of ideal agents. (shrink)

A recent development in the philosophy of religion has been the attempt to justify belief in God using Bayesian confirmation theory. My dissertation critically discusses two prominent spokesmen for this approach--Richard Swinburne and J. L. Mackie. Using probabilistic confirmation theory, these philosophers come to wildly divergent conclusions with respect to the hypothesis of theism; Swinburne contends that the evidence raises the overall probability of the hypothesis of theism, whereas Mackie argues that the evidence disconfirms the existence of God. After (...) a careful analysis of the individual authors, this dissertation critically examines the assumptions of the project. The authors consider arguments for the existence of God separately--the cosmological argument, the argument from design, apparent miracles, the problem of evil, and arguments from religious experience--and then conjoin them to assess the cumulative effect of the arguments. The assumptions are that the probability calculus may be interpreted for a successful inductive argument for or against the existence of God, that inference to best explanation is applicable to the justification of religious belief, that the justification of belief in God is analogous to the justification of a scientific theory, and that a classical foundationalist conception of rationality is correct. It is the contention of this dissertation that all of these assumptions are incorrect. All of the major interpretations of the probability calculus are examined and it is argued that there are either no interpretations for the probability assignments or no interpretations which will advance an argument for or against the existence of God. It is also argued that the usual methods for interpreting the explanatory power of theism will not determine any non-zero probabilities; however, density measuring will provide a non-zero interpretation. In the final chapter it is argued that a subjective Bayesian conception of rationality is neither a necessary nor a sufficient condition of rationality and that classical foundationalism is self-referentially inconsistent. An alternative approach to the rationality of religious belief is offered that proceeds along Reidian and Plantingan lines, belief in God is properly basic. (shrink)

The best and most popular argument for probabilism is the accuracy-dominance argument, which purports to show that alethic considerations alone support the view that an agent’s degrees of belief should always obey the axioms of probability. I argue that extant versions of the accuracy-dominance argument face a problem. In order for the mathematics of the argument to function as advertised, we must assume that every omniscient credence function is classically consistent; there can be no worlds in the set of dominance-relevant (...) worlds that obey some other logic. This restriction cannot be motivated on alethic grounds unless we’re also willing to accept that rationality requires belief in every metaphysical necessity, as the distinction between a priori logical necessities and a posteriori metaphysical ones is not an alethic distinction. To justify the restriction to classically consistent worlds, non-alethic motivation is required. And thus, if there is a version of the accuracy-dominance argument in support of probabilism, it isn’t one that is grounded in alethic considerations alone. (shrink)

Probabilistic methods are providing new explanatory approaches to fundamental cognitive science questions of how humans structure, process and acquire language. This review examines probabilistic models defined over traditional symbolic structures. Language comprehension and production involve probabilistic inference in such models; and acquisition involves choosing the best model, given innate constraints and linguistic and other input. Probabilistic models can account for the learning and processing of language, while maintaining the sophistication of symbolic models. A recent burgeoning of (...) theoretical developments and online corpus creation has enabled large models to be tested, revealing probabilistic constraints in processing, undermining acquisition arguments based on a perceived poverty of the stimulus, and suggesting fruitful links with probabilistic theories of categorization and ambiguity resolution in perception. (shrink)

This paper argues that if the world is irreducibly stochastic, then both Salmon's S-R model of explanation and Fetzer's C-R model of explanation have the following undesirable consequence: the objective probability (associated with the model's relevance condition) of any actual macro-event is either undefined or else, if defined, it equals one--so that the event is not even a candidate for a probabilistic explanation. This result follows from the temporal ambiguity of ontic probability in an irreducibly stochastic world. It is (...) argued further that an analogous difficulty faces those theories of probabilistic causality which depend upon the notions of contributing and counteracting causes. Because of the problem of temporal ambiguity, it is not possible to objectively label a particular event as a contributing (or a counteracting) cause of some subsequent event. The argument is carried through in detail for a recent theory of probabilistic causality proposed by Paul Humphreys. (shrink)

It is not only overtly probabilistic illatives like ‘makes it certain that’ but also apparently non-probabilistic ones like ‘therefore’ that have probabilistic import. Illatives like ‘therefore’ convey the meaning that the premise confers on the conclusion a probability not only greater than 0 but also greater than 1/2. But because they do not say whether that probability is equal to or less than 1, these illatives are appropriately called ‘neutral’.

Joyce () argues that for any credence function that doesn't satisfy the probability axioms, there is another function that dominates it in terms of accuracy. But if some potential credence functions are ruled out as violations of the Principal Principle, then some non‐probabilistic credence functions fail to be dominated. We argue that to fix Joyce's argument, one must show that all epistemic values for credence functions derive from accuracy.

The argument from silence is a pattern of reasoning in which the failure of a known source to mention a particular fact or event is used as the ground of an inference, usually to the conclusion that the supposed fact is untrue or the supposed event did not actually happen. Such arguments are widely used in historical work, but they are also widely contested. This paper surveys some inadequate attempts to model this sort of argument, offers a new analysis (...) using a Bayesian probabilistic framework that isolates the most problematic step in such arguments, illustrates a key problem besetting many uses of the argument, diagnoses the attraction of the argument in terms of a known human cognitive bias affecting the critical step, and suggests a standard that must be met in order for any argument from silence to have more than a very weak influence on historical reasoning. (shrink)

Experimental research shows that human sentence processing uses information from different levels of linguistic analysis, for example, lexical and syntactic preferences as well as semantic plausibility. Existing computational models of human sentence processing, however, have focused primarily on lexico‐syntactic factors. Those models that do account for semantic plausibility effects lack a general model of human plausibility intuitions at the sentence level. Within a probabilistic framework, we propose a wide‐coverage model that both assigns thematic roles to verb–argument pairs and determines (...) a preferred interpretation by evaluating the plausibility of the resulting (verb, role, argument) triples. The model is trained on a corpus of role‐annotated language data. We also present a transparent integration of the semantic model with an incremental probabilistic parser. We demonstrate that both the semantic plausibility model and the combined syntax/semantics model predict judgment and reading time data from the experimental literature. (shrink)

Decision-theoretic representation theorems have been developed and appealed to in the service of two important philosophical projects: in attempts to characterise credences in terms of preferences, and in arguments for probabilism. Theorems developed within the formal framework that Savage developed have played an especially prominent role here. I argue that the use of these ‘Savagean’ theorems create significant difficulties for both projects, but particularly the latter. The origin of the problem directly relates to the question of whether we can (...) have credences regarding acts currently under consideration and the consequences which depend on those acts; I argue that such credences are possible. Furthermore, I argue that attempts to use Jeffrey’s non-Savagean theorem in the service of these two projects may not fare much better. (shrink)

John Dupré (1984) has recently criticized the theory of probabilistic causality developed by, among others, Good (1961-62), Suppes (1970), Cartwright (1979), and Skyrms (1980). He argues that there is a tension or incompatibility between one of its central requirements for the presence of a causal connection, on the one hand, and a feature of the theory pointed out by Elliott Sober and me (1983), on the other. He also argues that the requirement just alluded to should be given up. (...) I defend the theory against Dupré's criticisms and conclude with comments on Dupré's appraisal of the bearing of his arguments on the nature of probabilistic causal laws. (shrink)

This work is in two parts. The main aim of part 1 is a systematic examination of deductive, probabilistic, inductive and purely inductive dependence relations within the framework of Kolmogorov probability semantics. The main aim of part 2 is a systematic comparison of (in all) 20 different relations of probabilistic (in)dependence within the framework of Popper probability semantics (for Kolmogorov probability semantics does not allow such a comparison). Added to this comparison is an examination of (in all) 15 (...) purely inductive dependence relations. ————Part 1 leads in an axiomatic step-by-step development from the elementary classical truth value semantics of a sentential-logical language, called ‘L’, (chapter 1) to the elementary Kolmogorov probability semantics of L (chapter 2), which is then extended to four axiomatic semantical theories of dependence relations between the formulae of L. First the elementary Kolmogorov probability semantics of L is extended to a theory, called ‘Kdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 3). Then Kdd is extended to a theory, called ‘Kpd1’, of the degree to which formulae of L probabilistically depend on each other in regard to a given probability distribution on the set of all formulae of L (chapter 4). Kpd1, in its turn, gets extended to a theory, called ‘Kpd2’, of the relations of probabilistic dependence and independence, relativized to unary Kolmogorov probability functions defined on L (chapter 5). Then Kpd2 is extended to a theory, called ‘Kid’, of the relations of inductive dependence and inductive independence, again relativized to unary Kolmogorov probability functions defined on L (chapter 6). Finally, Kid is extended to a theory, called ‘Kpid’, of the relations of purely inductive positive and negative dependence, relativized to unary Kolmogorov probability functions defined on L (chapter 7). ——Chapter 1, which deals with the familiar notions of truth value functions, tautologies, consequence relations and relations of logical opposition, is naturally the shortest chapter of part 1.——In chapter 2, the elementary classical semantics of L is extended to the elementary Kolmogorov probability semantics of L, i.e. to an axiomatic theory of unary and of binary Kolmogorov probability functions defined on the set of formulae of L. Because of the elementary character of this theory, chapter 2 is also rather short.——Chapter 3 introduces the first theory on dependence relations, to wit: Kdd, the theory of deductive (in)dependence between formulae of L. I follow here the well-known idea of Popper and Miller, who have used it in a famous discussion on the nature of probabilistic support for their arguments that probabilistic support is deductive, not inductive. I develop Kdd in the form of about 100 theorems, making ample use of the fact that deductive independence is nothing but subcontrary opposition, and close with a remark on the fundamental difference between deductive and logical dependence—two relations the ideas of which are all too easily mixed up.——Chapters 4 and 5 deal extensively with the traditional ideas of probabilistic (in)dependence, applied to formulae rather than to events. As always, I proceed axiomatically in a step-by-step process under systematic viewpoints and obtain about 300 theorems in this way. In the formulation of the theorems, I took special care to state clearly and expressly so-called tacit assumptions, especially those concerning the probability values of the formulae said to be dependent on each other. These assumptions are usually missing in the literature, due either to economy of writing or to sloppiness of thinking. Presumably, both chapters contain little that is new, their value lying more in the systematic grouping and organic development of the theorems than in the newness of these.——In chapter 6, I extend the axiomatic theory about probabilistic (in)dependence which has been elaborated in chapter 5, to an axiomatic theory of inductive (in)dependence by requiring of the relation of inductive (in)dependence that it be probabilistic (in)dependence, but not also logical implication or logical opposition. I point out the differences between probabilistic and inductive (in)dependence by means of some 60 theorems and close my examination of inductive (in)dependence by considering its relationship to the notion of support in the philosophy of science.——Finally, in chapter 7, the last of part 1, I take the step from inductive dependence to what I call ‘purely inductive dependence’ by combining the idea of inductive dependence with that of deductive independence in a way which is suggested by writings of Popper and Miller. I arrive at two noteworthy theorems. Firstly, there is indeed no purely inductive support. But secondly, and perhaps amazingly, countersupport is purely inductive.————Whereas the probabilistic framework of part 1 of the present work is Kolmogorov probability semantics, the framework of part 2 is Popper probability semantics, which is not only worth examining as a fascinating alternative to orthodox Kolmogorov probability semantics, but also allows us to examine dependence relations more deeply, than Kolmogorov probability semantics does. Part 2 leads—again in an axiomatic step-by-step development—from the basic Popper probability semantics of L, called ‘Pb’, (chapter 8) via a probabilistic theory of logical attributes, called ‘Ps’, (chapter 9) to four axiomatic semantical theories of dependence relations between the formulae of L. First, Ps is extended to a theory, called ‘Pdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 10). Then Pdd is extended to a theory, called ‘Ppd’, of (in all) 20 relations of probabilistic (in)dependence, relativized to binary Popper probability functions defined on L (chapter 11). Ppd, in its turn, is extended to a theory, called ‘Pid’, of (in all) 10 relations of inductive dependence, again relativized to binary Popper probability functions defined on L (first part of chapter 12). Finally, Pid is extended to a theory, called ‘Ppid’, of (in all) 15 relations of purely inductive positive and negative dependence, relativized to binary Popper probability functions defined on L (second part of chapter 12).——Chapter 8, the first chapter of part 2 of the present work, is entirely preparatory. It introduces the axioms and about 180 theorems (150 of them together with their proofs) of basic Popper probability semantics in order to set this kind of semantics under way.——Then, in chapter 9, basic Popper probability semantics is extended to a probabilistic theory of logical properties of and relations between the formulae of L. Although I think that the way I did this extension is of some interest in itself, the main task of chapter 9 is again a preparatory one: to yield the indispensable lemmata (about 90 in number) for the theorems concerning probabilistic dependence relations in chapter 11 and concerning inductive dependence relations in chapter 12.——Chapter 10 brings the extension of Ps to the theory Pdd of deductive (in)dependence. Only half a dozen theorems are noted here for later use in the Pdd-extensions Ppd and Ppid. In view of the over 100 theorems already gained on this topic in the Kolmogorovian framework (cf. chapter 3), a similar extensive elaboration of Pdd would have been superfluous.——Chapter 11 is the most important one of part 2. It consists of a systematic comparison of 20 probabilistic (in)dependence concepts by means of about 230 theorems, obtained within the axiomatic theory Ppd, which is built up as an extension of Pdd. The main points of comparison were: differences in logical strength; reflexivity and symmetry; behaviour under the condition that the probability values of the formulae in question are extreme. It turned out that each of the examined concepts violates a strong and straightforward version of the intuitive requirement that probabilistic dependence should go with logical dependence. Whereas the corresponding chapter 5 in part 1 of the present work may not have led to new theorems, chapter 11 yields dozens of them in the process of comparison of concepts of dependence and independence which had—as far as I know—never before been treated in a single theoretical framework. With Popper probability semantics, this framework has become available, and here I have simply made full use of it.——In chapter 12, I extend the theory Ppd of probabilistic (in)dependence to the theories Pid and Ppid of inductive and purely inductive dependence, in a way very similar to that in which I have extended the theory Kpd2 to the theories Kid and Kpid in chapters 6 and 7. The first main result of Kpid (roughly: there is no purely inductive support) could be repeated for four of the five purely inductive positive dependence relations considered in chapter 12, whereas the second main result of Kpid (roughly: there is purely inductive countersupport ) could be repeated for each of the five examined purely inductive negative dependence relations. Chapter 12 closes with a brief recapitulation and critical discussion of the main results. (shrink)

According to Nancy Cartwright, a causal law holds just when a certain probabilistic condition obtains in all test situations which in turn satisfy a set of background conditions. These background conditions are shown to be inconsistent and, on separate account, logically incoherent. I offer a corrective reformulation which also incorporates a strategy for problems like Hesslow's thrombosis case. I also show that Cartwright's recent argument for modifying the condition to appeal to singular causes fails.Proposed modifications of the theory's (...) class='Hi'>probabilistic condition to handle effects with extreme probabilities (0 or 1) are found unsatisfactory. I propose a unified solution which also handles extreme causes. Undefined conditional probabilities give rise to three good, but non-equivalent, ways of formulating the theory. Various formulations appear in the literature. I give arguments to eliminate all but one candidate. Finally, I argue for a crucial new condition clause, and show how to extend the results beyond a simple probabilistic framework. (shrink)