A coherence-based probability semantics for categorical syllogisms of Figure I, which have transitive structures, has been proposed recently (Gilio, Pfeifer, & Sanfilippo [15]). We extend this work by studying Figure II under coherence. Camestres is an example of a Figure II syllogism: from Every P is M and No S is M infer No S is P. We interpret these sentences by suitable conditional probability assessments. Since the probabilistic inference of ~????|???? from the premise set {????|????, ~????|????} is not informative, (...) we add ????(????|(????∨????))>0 as a probabilistic constraint (i.e., an “existential import assumption”) to obtain probabilistic informativeness. We show how to propagate the assigned (precise or interval-valued) probabilities to the sequence of conditional events (????|????,~????|????,????|(????∨????)) to the conclusion ~????|???? . Thereby, we give a probabilistic meaning to the other syllogisms of Figure II. Moreover, our semantics also allows for generalizing the traditional syllogisms to new ones involving generalized quantifiers (like Most S are P) and syllogisms in terms of defaults and negated defaults. (shrink)

Various semantics for studying the square of opposition have been proposed recently. So far, only [14] studied a probabilistic version of the square where the sentences were interpreted by (negated) defaults. We extend this work by interpreting sentences by imprecise (set-valued) probability assessments on a sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square in terms of acceptability and show how to construct probabilistic versions of the square (...) of opposition by forming suitable tripartitions. Finally, as an application, we present a new square involving generalized quantifiers. (shrink)

In this paper we exploit the notions of conjoined and iterated conditionals, which are defined in the setting of coherence by means of suitable conditional random quantities with values in the interval [0,1]. We examine the iterated conditional (B|K)|(A|H), by showing that A|H p-entails B|K if and only if (B|K)|(A|H) = 1. Then, we show that a p-consistent family F={E1|H1, E2|H2} p-entails a conditional event E3|H3 if and only if E3|H3= 1, or (E3|H3)|QC(S) = 1 for some nonempty subset S (...) of F, where QC(S) is the quasi conjunction of the conditional events in S. Then, we examine the inference rules And, Cut, Cautious Monotonicity, and Or of System P and other well known inference rules (Modus Ponens, Modus Tollens, Bayes). We also show that QC(F)|C(F) = 1, where C(F) is the conjunction of the conditional events in F. We characterize p-entailment by showing that F p-entails E3|H3 if and only if (E3|H3)|C(F) = 1. Finally, we examine Denial of the antecedent and Affirmation of the consequent, where the p-entailment of (E3|H3) from F does not hold, by showing that (E3|H3)|C(F) is not equal to 1. (shrink)

I present a conceptual framework for classifying generalist and particularist approaches to conspiracy theories (CTs). Specifically, I exploit a probabilistic version of the hexagon of opposition which allows for systematically visualising the logical relations among basic philosophical positions concerning CTs. The probabilistic interpretation can also account for positions, which make weaker claims about CTs: e.g. instead of claiming ‘every CT is suspicious’ some theorists might prefer to claim ‘most CTs are suspicious’ and then ask about logical consequences of such claims. (...) Finally, I illustrate the proposed conceptual framework by selected claims about CTs drawn from the CT research literature. (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)

We present a unified approach for investigating rational reasoning about basic argument forms involving indicative conditionals, counterfactuals, and basic quantified statements within coherence-based probability logic. After introducing the rationality framework, we present an interactive view on the relation between normative and empirical work. Then, we report a new experiment which shows that people interpret indicative conditionals and counterfactuals by coherent conditional probability assertions and negate conditionals by negating their consequents. The data support the conditional probability interpretation of conditionals and the (...) narrow-scope reading of the negation of conditionals. Finally, we argue that coherent conditional probabilities are important for probabilistic analyses of conditionals, nonmonotonic reasoning, quantified statements, and paradoxes. (shrink)

ABSTRACTTo build a process model of the understanding of conditionals we extract a common core of three semantics of if-then sentences: the conditional event interpretation in the coherencebased probability logic, the discourse processingtheory of Hans Kamp, and the game-theoretical approach of Jaakko Hintikka. The empirical part reports three experiments in which each participant assessed the probability of 52 if-then sentencesin a truth table task. Each experiment included a second task: An n-back task relating the interpretation of conditionals to working memory, (...) a Bayesian bookbag and poker chip task relating the interpretation of conditionals to probability updating, and a probabilistic modus ponens task relating the interpretation of conditionals to a classical inference task. Data analysis shows that the way in which the conditionals are interpreted correlates with each of the supplementary tasks. The results are discussed within the process model proposed in the introduction. (shrink)

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular (...) we examine the Fréchet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction Cn+1 of n + 1 conditional events to the family {Cn,En+1|Hn+1}. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid. (shrink)

We present a coherence-based probability semantics for (categorical) Aristotelian syllogisms. For framing the Aristotelian syllogisms as probabilistic inferences, we interpret basic syllogistic sentence types A, E, I, O by suitable precise and imprecise conditional probability assessments. Then, we define validity of probabilistic inferences and probabilistic notions of the existential import which is required, for the validity of the syllogisms. Based on a generalization of de Finetti's fundamental theorem to conditional probability, we investigate the coherent probability propagation rules of argument forms (...) of the syllogistic Figures I, II, and III, respectively. These results allow to show, for all three Figures, that each traditionally valid syllogism is also valid in our coherence-based probability semantics. Moreover, we interpret the basic syllogistic sentence types by suitable defaults and negated defaults. Thereby, we build a knowledge bridge from our probability semantics of Aristotelian syllogisms to nonmonotonic reasoning. Finally, we show how the proposed semantics can be used to analyze syllogisms involving generalized quantifiers. (shrink)

We present a formal measure of argument strength, which combines the ideas that conclusions of strong arguments are (i) highly probable and (ii) their uncertainty is relatively precise. Likewise, arguments are weak when their conclusion probability is low or when it is highly imprecise. We show how the proposed measure provides a new model of the Ellsberg paradox. Moreover, we further substantiate the psychological plausibility of our approach by an experiment (N = 60). The data show that the proposed measure (...) predicts human inferences in the original Ellsberg task and in corresponding argument strength tasks. Finally, we report qualitative data taken from structured interviews on folk psychological conceptions on what argument strength means. (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)

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.

This paper continues our work on a coherence-based probability semantics for Aristotelian syllogisms (Gilio, Pfeifer, and Sanfilippo, 2016; Pfeifer and Sanfilippo, 2018) by studying Figure III under coherence. We interpret the syllogistic sentence types by suitable conditional probability assessments. Since the probabilistic inference of P|S from the premise set {.