Theories of relational concept acquisition based on structured intersection discovery predict that relational concepts with a probabilistic structure ought to be extremely difficult to learn. We report four experiments testing this prediction by investigating conditions hypothesized to facilitate the learning of such categories. Experiment 1 showed that changing the task from a category-learning task to choosing the “winning” object in each stimulus greatly facilitated participants' ability to learn probabilistic relational categories. Experiments 2 and 3 further investigated the mechanisms (...) underlying this “who's winning” effect. Experiment 4 replicated and generalized the “who's winning” effect with more natural stimuli. Together, our findings suggest that people learn relational concepts by a process of intersection discovery akin to schema induction, and that any task that encourages people to discover a higher order relation that remains invariant over members of a category will facilitate the learning of putatively probabilistic relational concepts. (shrink)

General epistemic polarization arises when the beliefs of a population grow further apart, in particular when all agents update on the same evidence. Epistemic factionalization arises when the beliefs grow further apart, but different beliefs also become correlated across the population. I present a model of how factionalization can emerge in a population of ideally rational agents. This kind of factionalization is driven by probabilistic relations between beliefs, with background beliefs shaping how the agents’ beliefs evolve in the light (...) of new evidence. Moreover, I show that in such a model, the only possible outcomes from updating on identical evidence are general convergence or factionalization. Beliefs cannot spread out in all directions: if the beliefs overall polarize, then it must result in factionalization. (shrink)

It can be challenging to learn algorithms due to the research of business-related few-shot classification problems. Therefore, in this paper, we evaluate the classification of few-shot learning in the commercial field. To accurately identify the categories of few-shot learning problems, we proposed a probabilistic network method based on few-shot and one-shot learning problems. The enhancement of the original data was followed by the subsequent development of the PN method based on feature extraction, category comparison, and loss function analysis. The (...) effectiveness of the method was validated using two examples. Experimental results demonstrate the ability of the PN method to effectively identify the categories of commercial few-shot learning problems. Therefore, the proposed method can be applied to business-related few-shot classification problems. (shrink)

In the paper the relation between the standard probabilistic characterization of the common cause and Bell's notion of local causality will be investigated. It will be shown that the probabilistic common cause follows from local causality if one accepts, as Bell did, two assumptions concerning the common cause: first, the common cause is localized in the intersection of the past of the correlating events; second, it provides a complete specification of the `beables' of this intersection. However, neither (...) assumptions are a priori requirements. In the paper the logical role of these assumptions will be studied and it will be shown that only the second assumption is necessary for the derivation of the probabilistic common cause from local causality. (shrink)

The postwar welfare state provides social insurance against economic, health, and related risks in an uncertain world. Because everyone can envision themselves to be among the unfortunate, social insurance fuses self-interest and solidarism in a normative principle Friedman (2020) calls probabilistic justice. But there is a competing principle of status defense, where the aim is to erect boundaries between socioeconomic strata and discourage cross-class mobility. We argue that this principle dominates when inequality is high and uncertainty low. The current (...) moment is one of high inequality and high uncertainty, which results in intense status anxiety, yet does not rule out solidaristic solutions. Our contributions are to diagnose the causes of our current malaise, and to theorize the normative bases for the political choice facing contemporary western democracies. (shrink)

The present study assessed the degree to which probabilistic reasoning performance and thinking style influenced perception of risk and self-reported levels of terrorism-related behaviour change. A sample of 263 respondents, recruited via convenience sampling, completed a series of measures comprising probabilistic reasoning tasks (perception of randomness, base rate, probability, and conjunction fallacy), the Reality Testing subscale of the Inventory of Personality Organization (IPO-RT), the Domain-Specific Risk-Taking Scale, and a terrorism-related behaviour change scale. Structural equation modelling examined three progressive (...) models. Firstly, the Independence Model assumed that probabilistic reasoning, perception of risk and reality testing independently predicted terrorism-related behaviour change. Secondly, the Mediation Model supposed that probabilistic reasoning and reality testing correlated, and indirectly predicted terrorism-related behaviour change through perception of risk. Lastly, the Dual-Influence Model proposed that probabilistic reasoning indirectly predicted terrorism-related behaviour change via perception of risk, independent of reality testing. Results indicated that performance on probabilistic reasoning tasks most strongly predicted perception of risk, and preference for an intuitive thinking style (measured by the IPO-RT) best explained terrorism-related behaviour change. The combination of perception of risk with probabilistic reasoning ability in the Dual-Influence Model enhanced the predictive power of the analytical-rational route, with conjunction fallacy having a significant indirect effect on terrorism-related behaviour change via perception of risk. The Dual-Influence Model possessed superior fit and reported similar predictive relations between intuitive-experiential and analytical-rational routes and terrorism-related behaviour change. The discussion critically examines these findings in relation to dual-processing frameworks. This includes considering the limitations of current operationalisations and recommendations for future research that align outcomes and subsequent work more closely to specific dual-process models. (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)

D. M. Armstrong famously claims that deterministic laws of nature are contingent relations between universals and that his account can also be straightforwardly extended to irreducibly probabilistic laws of nature. For the most part, philosophers have neglected to scrutinize Armstrong’s account of probabilistic laws. This is surprising precisely because his own claims about probabilistic laws make it unclear just what he takes them to be. We offer three interpretations of what Armstrong-style probabilistic laws are, and argue (...) that all three interpretations are incompatible either with some feature of Armstrong’s broader metaphysics or with essential features of his account of laws (or both). (shrink)

How can different individuals' probability assignments to some events be aggregated into a collective probability assignment? Classic results on this problem assume that the set of relevant events -- the agenda -- is a sigma-algebra and is thus closed under disjunction (union) and conjunction (intersection). We drop this demanding assumption and explore probabilistic opinion pooling on general agendas. One might be interested in the probability of rain and that of an interest-rate increase, but not in the probability of rain (...) or an interest-rate increase. We characterize linear pooling and neutral pooling for general agendas, with classic results as special cases for agendas that are sigma-algebras. As an illustrative application, we also consider probabilistic preference aggregation. Finally, we compare our results with existing results on binary judgment aggregation and Arrovian preference aggregation. This paper is the first of two self-contained, but technically related companion papers inspired by binary judgment-aggregation theory. (shrink)

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model- theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization (...) of default reasoning in System . That is, we provide a new probabilistic semantics for System , which neither uses infinitesimal probabilities nor atomic bound (or big-stepped) probabilities. These results also provide new algorithms for probabilistic reasoning under coherence and for default reasoning in System , and they give new insight into default reasoning with conditional objects. (shrink)

In the literature, different frameworks of probabilistic epistemic logic have been proposed. Most of these frameworks define knowledge or belief by relational structure. In this paper, we explore the relationship between probability and belief, based on the Lockean thesis, and adopt neighborhood semantics that defines belief directly using probability. We provide a sound and weakly complete axiomatization for our framework. We also try to explain the lottery paradox by modelling it within our framework. Moreover, the paper presents findings concerning (...) the relationship between knowledge, belief and probability within various frameworks. (shrink)

We provide self-contained proof of a theorem relating probabilistic coherence of forecasts to their non-domination by rival forecasts with respect to any proper scoring rule. The theorem recapitulates insights achieved by other investigators, and clarifi es the connection of coherence and proper scoring rules to Bregman divergence.

Remarkable progress in the mathematics and computer science of probability has led to a revolution in the scope of probabilistic models. In particular, ‘sophisticated’ probabilistic methods apply to structured relational systems such as graphs and grammars, of immediate relevance to the cognitive sciences. This Special Issue outlines progress in this rapidly developing field, which provides a potentially unifying perspective across a wide range of domains and levels of explanation. Here, we introduce the historical and conceptual foundations of the (...) approach, explore how the approach relates to studies of explicit probabilistic reasoning, and give a brief overview of the field as it stands today. (shrink)

This is part A of a paper in which we defend a semantics for counterfactuals which is probabilistic in the sense that the truth condition for counterfactuals refers to a probability measure. Because of its probabilistic nature, it allows a counterfactual ‘ifAthenB’ to be true even in the presence of relevant ‘Aand notB’-worlds, as long such exceptions are not too widely spread. The semantics is made precise and studied in different versions which are related to each other by (...) representation theorems. Despite its probabilistic nature, we show that the semantics and the resulting system of logic may be regarded as a naturalistically vindicated variant of David Lewis’ truth-conditional semantics and logic of counterfactuals. At the same time, the semantics overlaps in various ways with the non-truth-conditional suppositional theory for conditionals that derives from Ernest Adams’ work. We argue that counterfactuals have two kinds of pragmatic meanings and come attached with two types of degrees of acceptability or belief, one being suppositional, the other one being truth based as determined by our probabilistic semantics; these degrees could not always coincide due to a new triviality result for counterfactuals, and they should not be identified in the light of their different interpretation and pragmatic purpose. However, for plain assertability the difference between them does not matter. Hence, if the suppositional theory of counterfactuals is formulated with sufficient care, our truth-conditional theory of counterfactuals is consistent with it. The results of our investigation are used to assess a claim considered by Hawthorne and Hájek, that is, the thesis that most ordinary counterfactuals are false. (shrink)

Promotion is the relation between an act and a desire that obtains when the act advances or serves the desire. Under what conditions does an act promote a desire? Probabilistic accounts of promotion, the most prominent accounts, analyze promotion in terms of an increase in the probability of the desire’s satisfaction. In this paper, we clarify the promotion relation and explain why probabilistic accounts are attractive. Then we identify two questions probabilistic accounts must answer: the (...) Baseline Question and the Interpretation Question. We discuss and reject the three answers to the Baseline Question found in the literature, and explain the challenge future attempts at answering this question will face. Proponents of probabilistic accounts have not adequately addressed the Interpretation Question. We survey three answers to this question, finding each unsatisfactory. We conclude that no satisfactory probabilistic account has yet been offered, and that there are significant hurdles to providing one in the future. (shrink)

We investigate the discrete (finite) case of the Popper–Renyi theory of conditional probability, introducing discrete conditional probabilistic models for knowledge and conditional belief, and comparing them with the more standard plausibility models. We also consider a related notion, that of safe belief, which is a weak (non-negatively introspective) type of “knowledge”. We develop a probabilistic version of this concept (“degree of safety”) and we analyze its role in games. We completely axiomatize the logic of conditional belief, knowledge and (...) safe belief over conditional probabilistic models. We develop a theory of probabilistic dynamic belief revision, introducing probabilistic “action models” and proposing a notion of probabilistic update product, that comes together with appropriate reduction laws. (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)

Developments in the Academy from the time of Arcesilaus to that of Carneades and his successors tend to be classified under two heads: scepticism and probabilism. Carneades was principally responsible for the Academy's view of the latter subject, and our sources credit him with an elaborate discussion of it. The evidence furnished by those sources is, however, frequently confusing and sometimes self-contradictory. My aim in this paper is to extract a coherent account of Carneades' theory of probability from the testimony (...) with a further end in view, namely to understand better the uses to which that theory was put by the Academy in its debate with the Stoa. Though it is not its principal object, the investigation should also help make clear how the Academy's scepticism and its probabilism were related to each other as parts of a single consistent practice of philosophy. (shrink)

Natural information refers to the information carried by natural signs such as that smoke is thought to carry natural information about fire. A number of influential philosophers have argued that natural information can also be utilized in a theory of mental content. The most widely discussed account of natural information holds that it results from an extremely strong relation between sign and signified. Critics have responded that it is doubtful that there are many strong relations of this sort in (...) the natural world due to variability between signs and signified. In light of this observation, a promising suggestion is that much of the interesting natural information carried by natural signs is really information with a probabilistic content. However, Dretske’s theory cannot account for this information because it would require implausible second order objective probabilities. Given the most plausible understanding of the probabilities involved here, I argue that it is only sequences of traditional natural signs that carry this probabilistic information. Several implications of this idea will be explored. (shrink)

It seems to be generally accepted that (a) counterfactual conditionals are to be analysed in terms of possible worlds and inter-world relations of similarity and (b) causation is conceptually prior to counterfactuals. I argue here that both (a) and (b) are false. The argument against (a) is not a general metaphysical or epistemological one but simply that, structurally speaking, possible worlds theories are wrong: this is revealed when we try to extend them to cover the case of probabilistic counterfactuals. (...) Indeed a type of counterfactual probability exists which cannot be expressed in possible worlds terms at all. The argument against (b) emerges when we look at the form of an adequate account of both probabilistic and non-probabilistic counterfactuals. I do this by sketching and defending an approach to counterfactuals that, first, invoke a generalized notion of cause as primitive and, secondly, is algorithmic in form: counterfactuals are evaluated algorithmically in terms of other counterfactuals, without vicious circularity. Structures like possible worlds do not play a role either in general truth-conditions or in evaluation. They are simply the wrong sorts of structures. (shrink)

How can different individuals' probability functions on a given sigma-algebra of events be aggregated into a collective probability function? Classic approaches to this problem often require 'event-wise independence': the collective probability for each event should depend only on the individuals' probabilities for that event. In practice, however, some events may be 'basic' and others 'derivative', so that it makes sense first to aggregate the probabilities for the former and then to let these constrain the probabilities for the latter. We formalize (...) this idea by introducing a 'premise-based' approach to probabilistic opinion pooling, and show that, under a variety of assumptions, it leads to linear or neutral opinion pooling on the 'premises'. This paper is the second of two self-contained, but technically related companion papers inspired by binary judgment-aggregation theory. (shrink)

In classical physics, probabilistic or statistical knowledge has been always related to ignorance or inaccurate subjective knowledge about an actual state of affairs. This idea has been extended to quantum mechanics through a completely incoherent interpretation of the Fermi-Dirac and Bose-Einstein statistics in terms of "strange" quantum particles. This interpretation, naturalized through a widespread "way of speaking" in the physics community, contradicts Born's physical account of Ψ as a "probability wave" which provides statistical information about outcomes that, in fact, (...) cannot be interpreted in terms of 'ignorance about an actual state of affairs'. In the present paper we discuss how the metaphysics of actuality has played an essential role in limiting the possibilities of understating things differently. We propose instead a metaphysical scheme in terms of powers with definite potentia which allows us to consider quantum probability in a new light, namely, as providing objective knowledge about a potential state of affairs. (shrink)

We present two approaches to investigate the validity of connexive principles and related formulas and properties within coherence-based probability logic. Connexive logic emerged from the intuition that conditionals of the form if not-A, thenA, should not hold, since the conditional’s antecedent not-A contradicts its consequent A. Our approaches cover this intuition by observing that the only coherent probability assessment on the conditional event $${A| \overline{A}}$$ A | A ¯ is $${p(A| \overline{A})=0}$$ p ( A | A ¯ ) = 0. (...) In the first approach we investigate connexive principles within coherence-based probabilistic default reasoning, by interpreting defaults and negated defaults in terms of suitable probabilistic constraints on conditional events. In the second approach we study connexivity within the coherence framework of compound conditionals, by interpreting connexive principles in terms of suitable conditional random quantities. After developing notions of validity in each approach, we analyze the following connexive principles: Aristotle’s theses, Aristotle’s Second Thesis, Abelard’s First Principle, and Boethius’ theses. We also deepen and generalize some principles and investigate further properties related to connexive logic (like non-symmetry). Both approaches satisfy minimal requirements for a connexive logic. Finally, we compare both approaches conceptually. (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)

It is shown that the probabilistic theories of coherence proposed up to now produce a number of counter-intuitive results. The last section provides some reasons for believing that no probabilistic measure will ever be able to adequately capture coherence. First, there can be no function whose arguments are nothing but tuples of probabilities, and which assigns different values to pairs of propositions {A, B} and {A, C} if A implies both B and C, or their negations, and if (...) P(B)=P(C). But such sets may indeed differ in their degree of coherence. Second, coherence is sensitive to explanatory relations between the propositions in question. Explanation, however, can hardly be captured solely in terms of probability. (shrink)

There have been two principal paradigms for the formulation of the causal relation--logical implication and functional relationship. In this paper, I present a case for preferring the functional relationship formulation and then discuss how the functional relationship formulation may be implemented in the probabilistic case in a manner analogous to the way others have implemented the logical implication formulation in the probabilistic case. I show how the "local independence" assumption found in many models used in the behavioral (...) and social sciences is a consequence of the functional relation concept of probabilistic causality. I also discuss why causal relations are underdetermined in experience and are to be dealt with pragmatically in a hypothesis-testing framework. (shrink)

This paper aims to extend in two directions the probabilistic dynamic epistemic logic provided in Kooi’s paper (J Logic Lang Inform 12(4):381–408, 2003) and to relate these extensions to ones made in van Benthem et al. (Proceedings of LOFT’06. Liverpool, 2006). Kooi’s probabilistic dynamic epistemic logic adds to probabilistic epistemic logic sentences that express consequences of public announcements. The paper (van Benthem et al., Proceedings of LOFT’06. Liverpool, 2006) extends (Kooi, J Logic Lang Inform 12(4):381–408, 2003) to (...) using action models, but in both papers, the probabilities are discrete, and are defined on trivial σ -algebras over finite sample spaces. The first extension offered in this paper is to add a previous-time operator to a probabilistic dynamic epistemic logic similar to Kooi’s in (J Logic Lang Inform 12(4):381–408, 2003). The other is to involve non-trivial σ -algebras and continuous probabilities in probabilistic dynamic epistemic logic. (shrink)

Enculturation is known to shape the perception of meter in music but this is not explicitly accounted for by current cognitive models of meter perception. We hypothesize that meter perception is a strategy for increasing the predictability of rhythmic patterns and that the way in which it is shaped by the cultural environment can be understood in terms of probabilistic predictive coding. Based on this hypothesis, we present a probabilistic model of meter perception that uses statistical properties of (...) the relation between rhythm and meter to infer meter from quantized rhythms. We show that our model can successfully predict annotated time signatures from quantized rhythmic patterns derived from folk melodies. Furthermore, we show that by inferring meter, our model can better predict the onsets of future events than a similar probabilistic model that does not infer meter. Finally, we demonstrate how our model can be used in a proof-of-concept simulation of enculturation. From this simulation, we derive a class of rhythms that are likely to be interpreted differently by enculturated listeners with different histories of exposure to rhythms. (shrink)

A probabilistic theory of causation is a theory which holds that the central feature of causation is that causes raise the probability of their effects. In this dissertation, I defend Hans Reichenbach's original version of the probabilistic theory of causation, which analyses causal relations in terms of a three place statistical betweenness relation. Unlike most discussions of this theory, I hold that the statistical relation should be taken as a sufficient, but not as a necessary , (...) condition for causal betweenness. With this difference in interpretation, Reichenbach's theory is shown to be immune to all of the criticisms which have been raised against it in the last fifty years. ;Reichenbach's main purpose in defending a probabilistic theory of causation was to use it in giving an analysis of the direction of time. I defend this view, arguing that the arrow of causation is more basic than any of the other arrows of time---metaphysical, psychological or physical. In particular, I argue against the popular view that the direction of time is given by the physical fact that entropy only increases in one direction. I further show that the probabilistic theory of causation is particularly suited to the task of analysing the various arrows of time. In my final chapter, I also suggest that the probabilistic theory of causation may be fruitfully applied to the analysis of some important puzzles in the interpretation of quantum mechanics. (shrink)

This paper defends two related claims about belief. First, the claim that unlike numerical degrees of belief, comparative beliefs are primitive and psychologically real. Second, the claim that the fundamental norm of Probabilism is not that numerical degrees of belief should satisfy the probability axioms, but rather that comparative beliefs should satisfy certain constraints.

In ethics, ‘probabilism’ refers to a position defended by a number of Catholic theologians, mainly in the sixteenth and seventeenth centuries. They held that, when one is uncertain which of a range of actions is the right one to perform, it is permissible to perform any which has a good chance of being the right one—even if there is another which has a better chance. This paper considers the value of this position from the viewpoint of modern ethical philosophy. The (...) unusual nature of probabilism as a theory focusing upon permissibility, rather than right-making properties, is explored and related to some modern attempts to set out ‘satisficing’ and ‘hybrid’ ethical theories. Such theories try to distinguish between what is best and what is permissible, and probabilism can be understood as an alternative way of supplementing a theory of right-making properties by adding to it a theory of permissibility. But a more radical version is also possible, where one abandons any attempt to identify right actions or right-making properties, and instead considers permissibility alone. Accordingly, a ‘multi-account theory’ of permissibility is proposed and defended as a model of how many people actually make moral decisions. (shrink)

A theory of approximation to measurable sets and measurable functions based on the concepts of recursion theory and discrete complexity theory is developed. The approximation method uses a model of oracle Turing machines, and so the computational complexity may be defined in a natural way. This complexity measure may be viewed as a formulation of the average-case complexity of real functions—in contrast to the more restrictive worst-case complexity. The relationship between these two complexity measures is further studied and compared with (...) the notion of the distribution-free probabilistic computation. The computational complexity of the Lebesgue integral of polynomial-time approximable functions is studied and related to the question “FP = ♯P?”. (shrink)

After Karl Popper’s original work, several approaches were developed to provide a sound explication of the notion of verisimilitude. With few exceptions, these contributions have assumed that the truth to be approximated is deterministic. This collection of ten papers addresses the more general problem of approaching probabilistic truths. They include attempts to find appropriate measures for the closeness to probabilistic truth and to evaluate claims about such distances on the basis of empirical evidence. The papers employ multiple analytical (...) approaches, and connect the research to related issues in the philosophy of science. (shrink)

We investigate an approach for drawing logical inference from inconsistent premisses. The main idea in this approach is that the inconsistencies in the premisses should be interpreted as uncertainty of the information. We propose a mechanism, based on Kinght’s [14] study of inconsistency, for revising an inconsistent set of premisses to a minimally uncertain, probabilistically consistent one. We will then generalise the probabilistic entailment relation introduced in [15] for propositional languages to the first order case to draw logical (...) inference from a probabilistic set of premisses. We will show how this combination can allow us to limit the effect of uncertainty introduced by inconsistent premisses to only the reasoning on the part of the premise set that is relevant to the inconsistency. (shrink)

Theorists have consistently maintained that the most plausible forms of objective consequentialism must be probabilistic if and only if indeterminism is true. This standard position, however popular, lacks sufficient motivation. Assume determinism to be true and an attempt will be made to show that attractive forms of objective consequentialism must be probabilistic - and not for reasons related to our epistemic limitations either. -/- Here it is argued that all extant objective formulations of consequentialism fail to deliver the (...) normative implications that the spirit of objective consequentialism requires. My argument rests upon the claim that certain pairs of subjunctive conditionals with identical antecedents and incompatible consequents are such that neither of the pair is true. -/- Upon leveling the objection, the concept of an "objective" subjunctive probability is introduced and utilized in the transformation of a subjective version of expected act utility consequentialism into an objective version, one that is capable of dealing with the difficulties posed by the objection. I end by indicating some ways in which the closest thing to a plausible, objective form of consequentialism might be developed. (shrink)

Larry Wright and others have advanced causal accounts of functional explanation, designed to alleviate fears about the legitimacy of such explanations. These analyses take functional explanations to describe second order causal relations. These second order relations are conceptually puzzling. I present an account of second order causation from within the framework of Eells' probabilistic theory of causation; the account makes use of the population-relativity of causation that is built into this theory.

A probabilistic Chomsky–Schützenberger hierarchy of grammars is introduced and studied, with the aim of understanding the expressive power of generative models. We offer characterizations of the distributions definable at each level of the hierarchy, including probabilistic regular, context-free, (linear) indexed, context-sensitive, and unrestricted grammars, each corresponding to familiar probabilistic machine classes. Special attention is given to distributions on (unary notations for) positive integers. Unlike in the classical case where the "semi-linear" languages all collapse into the regular languages, (...) using analytic tools adapted from the classical setting we show there is no collapse in the probabilistic hierarchy: more distributions become definable at each level. We also address related issues such as closure under probabilistic conditioning. (shrink)

Various semantics for studying the square of opposition and the hexagon of opposition have been proposed recently. We interpret sentences by imprecise (set-valued) probability assessments on a finite sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square and of the hexagon in terms of acceptability. Then, we show how to construct probabilistic versions of the square and of the hexagon of opposition by forming suitable tripartitions of (...) the set of all coherent assessments. Finally, as an application, we present new versions of the square and of the hexagon involving generalized quantifiers. (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)

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)

We present an interdisciplinary approach to argumentation combining logical, probabilistic, and psychological perspectives. We investigate logical attack principles which relate attacks among claims with logical form. For example, we consider the principle that an argument that attacks another argument claiming A triggers the existence of an attack on an argument featuring the stronger claim A ∧ B. We formulate a number of such principles pertaining to conjunctive, disjunctive, negated, and implicational claims. Some of these attack principles seem to be (...) prima facie more plausible than others. To support this intuition, we suggest an interpretation of these principles in terms of coherent conditional probabilities. This interpretation is naturally generalized from qualitative to quantitative principles. Specifically, we use our probabilistic semantics to evaluate the rationality of principles which govern the strength of argumentative attacks. In order to complement our theoretical analysis with an empirical perspective, we present an experiment with students of the TU Vienna ( n = 139) which explores the psychological plausibility of selected attack principles. We also discuss how our qualitative attack principles relate to well-known types of logical argumentation frameworks. Finally, we briefly discuss how our approach relates to the computational argumentation literature. (shrink)