In some recent works, Crupi and Iacona have outlined an analysis of ‘if’ based on Chrysippus’ idea that a conditional holds whenever the negation of its consequent is incompatible with its antecedent. This paper presents a sound and complete system of conditional logic that accommodates their analysis. The soundness and completeness proofs that will be provided rely on a general method elaborated by Raidl, which applies to a wide range of systems of conditional logic.

The variably strict analysis of conditionals does not only largely dominate the philosophical literature, since its invention by Stalnaker and Lewis, it also found its way into linguistics and psychology. Yet, the shortcomings of Lewis–Stalnaker’s account initiated a plethora of modifications, such as non-vacuist conditionals, presuppositional indicatives, perfect conditionals, or other conditional constructions, for example: reason relations, difference-making conditionals, counterfactual dependency, or probabilistic relevance. Many of these new connectives can be treated as strengthened or weakened conditionals. They are definable conditionals. (...) This article develops a technique to infer the logic for such definable conditionals from the known logic of the underlying defining conditional. The technique is applied to central examples. The results show that a large part of the zoo of conditionals arises from a basic conditional—a constant nucleus of the different contextual and conceptual variations of variably strict conditionals. (shrink)

This paper investigates the implicative conditional, a connective intended to describe the logical behavior of an empirically defined class of natural language conditionals, also named implicative conditionals, which excludes concessive and some other conditionals. The implicative conditional strengthens the strict conditional with the possibility of the antecedent and of the contradictory of the consequent. $${p\Rightarrow q}$$ p ⇒ q is thus defined as $${\lnot } \Diamond {(p \wedge \lnot q) \wedge } \Diamond {p \wedge } \Diamond {\lnot q}$$ ¬ ◊ (...) ( p ∧ ¬ q ) ∧ ◊ p ∧ ◊ ¬ q. We explore the logical properties of this conditional in a reflexive normal Kripke semantics, provide an axiomatic system and prove it to be sound and complete for our semantics. The implicative conditional validates transitivity and contraposition, which we take to be integral parts of reasoning and communication. But it only validates restricted versions of strengthening the antecedent, right weakening, simplification, and rational monotonicity. Apparent counterexamples to some of these properties are explained as due to contextual factors. Finally, the implicative conditional avoids the paradoxes of material and strict implication, and validates some connexive principles such as Aristotle’s theses and weak Boethius’ thesis, as well as some highly entrenched principles of conditionals, such as conjunction of consequents, disjunction of antecedents, modus ponens, cautious monotonicity and cut. (shrink)

Standard conditionals $\varphi > \psi$, by which I roughly mean variably strict conditionals à la Stalnaker and Lewis, are trivially true for impossible antecedents. This article investigates three modifications in a doxastic setting. For the neutral conditional, all impossible-antecedent conditionals are false, for the doxastic conditional they are only true if the consequent is absolutely necessary, and for the metaphysical conditional only if the consequent is ‘model-implied’ by the antecedent. I motivate these conditionals logically, and also doxastically by properties of (...) conditional belief and belief revision. For this I show that the Lewisian hierarchy of conditional logics can be reproduced within ranking semantics, provided we slightly stretch the notion of a ranking function. Given this, acceptance of a conditional can be interpreted as a conditional belief. The epistemic and the neutral conditional deviate from Lewis’ weakest system $V$, in that ID or even CN are dropped, and new axioms appear. The logic of the metaphysical conditional is completely axiomatised by $V$ to which we add the known Kripke axioms T5 for the outer modality. Related completeness results for variations of the ranking semantics are obtained as corollaries. (shrink)

This paper studies proof systems for the logics of super-strict implication ST2–ST5, which correspond to C.I. Lewis’ systems S2–S5 freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating STn in Sn and backsimulating Sn in STn, respectively(for n=2,...,5). Next, G3-style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive of G3-style calculi, that they are sound and complete, and (...) it is shown that the proof search for G3. ST2 is terminating and therefore the logic is decidable. (shrink)

According to the analysis of concessive conditionals suggested by Crupi and Iacona, a concessive conditional \(p{{\,\mathrm{\hookrightarrow }\,}}q\) is adequately formalized as a conjunction of conditionals. This paper presents a sound and complete axiomatic system for concessive conditionals so understood. The soundness and completeness proofs that will be provided rely on a method that has been employed by Raidl, Iacona, and Crupi to prove the soundness and completeness of an analogous system for evidential conditionals.

This paper explores the connective ‘because’, based on the idea that ‘CbecauseA’ implies the acceptance/truth of the antecedentAas well as of the consequentC, and additionally that the antecedent makes a difference for the consequent. To capture this idea of difference-making a ‘relevantized’ version of the Ramsey Test for conditionals is employed that takes the antecedent to be relevant to the consequent in the following sense: a conditional is true/accepted in a state$$\sigma $$σjust in case (i) the consequent is true/accepted when$$\sigma (...) $$σis revised by the antecedentand(ii) the consequent fails to be true/accepted when$$\sigma $$σis revised by the antecedent’s negation. To extend this to a semantics for ‘because’, we add that (iii) the antecedent and (iv) the consequent are accepted/true in the state$$\sigma $$σ. We get metaphysical or doxastic interpretations of these clauses, depending on what we mean by a model and a state. We introduce several semantics known from suppositional conditionals, which we reinterpret for difference-making conditionals and ‘because’. We present a minimal logic for ‘because’ sentences and show how it can be extended in ways that parallel the hierarchy of extensions of the logic of suppositional conditionals. We establish correspondence results between axioms for ‘because’ and properties of states, and prove that the specified logics are sound with respect to the semantics. (shrink)

In this paper we compare Leitgeb’s stability theory of belief and Spohn’s ranking-theoretic account of belief. We discuss the two theories as solutions to the lottery paradox. To compare the two theories, we introduce a novel translation between ranking functions and probability functions. We draw some crucial consequences from this translation, in particular a new probabilistic belief notion. Based on this, we explore the logical relation between the two belief theories, showing that models of Leitgeb’s theory correspond to certain models (...) of Spohn’s theory. The reverse is not true. Finally, we discuss how these results raise new questions in belief theory. In particular, we raise the question whether stability is rightly thought of as a property pertaining to belief. (shrink)

Orthodox Bayesianism endorses revising by conditionalization. This paper investigates the zero-raising problem, or equivalently the certainty-dropping problem of orthodox Bayesianism: previously neglected possibilities remain neglected, although the new evidence might suggest otherwise. Yet, one may want to model open-minded agents, that is, agents capable of raising previously neglected possibilities. Different reasons can be given for open-mindedness, one of which is fallibilism. The paper proposes a family of open-minded propositional revisions depending on a parameter ϵ. The basic idea is this: first (...) extend the prior to the newly suggested possibilities by mixing the prior with the uniform probability on these possibilities, then conditionalize. This may put the agent back on the right track when her beliefs or evidence happen to be false. The paper justifies this family of equivocal epsilon-conditionalizations as minimal non-biased open-minded modifications of conditionalization. Several variations are discussed, such as mixing with an ad hoc or silent prior instead of the uniform prior, and a generalization to probabilistic information is given. The approach is compared to other accounts, such as Jeffrey’s Bayesianism, Gärdenfors’s probabilistic revision, maximizing entropy, and minimal revision. _1_ Introduction _2_ Downsides of Certainty Conservation _3_ Why Raise Zeros? _3.1_ Accuracy defects _3.2_ Fallibilism and dissolutions _3.3_ Weak fallibilism and partial solutions _4_ Epsilon-Conditionalization _4.1_ Definitions _4.2_ Revision types and information assumptions _4.3_ Epsilon interpretation and flavours _5_ Justifications _5.1_ Open-minded orthodox Bayesianism _5.2_ Minimal revision _5.3_ Transitivity _6_ Conclusion Appendix. (shrink)

Günther recently suggested a 'new‘ conditional. This conditional is not new, as already remarked by Wansing and Omori. It is just David Lewis‘ forgotten alternative 'doctored‘ conditional and part of a larger class termed neutral conditionals. In this paper, I answer some questions raised by Wansing and Omori, concerning the motivation, the logic, the connexive flavor and contra-classicality of such neutralized conditionals. The main message being: Neutralizing a vacuist conditional avoids (some) paradoxes of strict implication, changes the logic essentially only (...) by Aristotle‘s Thesis, makes strong connexivity impossible, and remains in the realm of non-contra-classical logics. (shrink)

This paper studies proof systems for the logics of super-strict implication \(\textsf{ST2}\) – \(\textsf{ST5}\), which correspond to C.I. Lewis’ systems \(\textsf{S2}\) – \(\textsf{S5}\) freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating \(\textsf{STn}\) in \(\textsf{Sn}\) and backsimulating \(\textsf{Sn}\) in \(\textsf{STn}\), respectively (for \({\textsf{n}} =2, \ldots, 5\) ). Next, \(\textsf{G3}\) -style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive (...) of \(\textsf{G3}\) -style calculi, that they are sound and complete, and it is shown that the proof search for \(\mathsf {G3.ST2}\) is terminating and therefore the logic is decidable. (shrink)

According to the analysis of concessive conditionals suggested by Crupi and Iacona, a concessive conditional $$p{{\,\mathrm{\hookrightarrow }\,}}q$$ p ↪ q is adequately formalized as a conjunction of conditionals. This paper presents a sound and complete axiomatic system for concessive conditionals so understood. The soundness and completeness proofs that will be provided rely on a method that has been employed by Raidl, Iacona, and Crupi to prove the soundness and completeness of an analogous system for evidential conditionals.

According to Stalnaker’s Thesis, the probability of a conditional is the conditional probability. Under some mild conditions, the thesis trivialises probabilities and conditionals, as initially shown by David Lewis. This article asks the following question: does still lead to triviality, if the probability function in is replaced by a probability-like function? The article considers plausibility functions, in the sense of Friedman and Halpern, which additionally mimic probabilistic additivity and conditionalisation. These quasi probabilities comprise Friedman–Halpern’s conditional plausibility spaces, as well as (...) other known representations of conditional doxastic states. The paper proves Lewis’ triviality for quasi probabilities and discusses how this has implications for three other prominent strategies to avoid Lewis’ triviality: Adams’ thesis, where the probability function on the left in is replaced by a probability-like function, abandoning conditionalisation, where probability conditionalisation on the right in is replaced by another propositional update procedure and the approximation thesis, where equality in is replaced by approximation. The paper also shows that Lewis’ triviality result is really about ‘additiveness’ and ‘conditionality’. (shrink)

Proves Completeness for the Evidential Conditional.

In this paper we study changes of beliefs in a ranking-theoretic setting using non-extremal implausibility thresholds for belief. We represent implausibilities as ranks and introduce natural rank changes subject to a minimal change criterion. We show that many of the traditional AGM postulates for revision and contraction are preserved, except for the postulate of Preservation which is invalid. The diagnosis for belief contraction is similar, but not exactly the same. We demonstrate that the one-shot versions of both revision and contraction (...) can be represented as revisions based on semiorders, but in two subtly different ways. We provide sets of postulates that are sound and complete in the sense that they allow us to prove representation theorems. We show that, and explain why, the classical duality between revision and contraction, as exhibited by the Levi and Harper identities, is partly broken by threshold-based belief changes. We also study the logic of iterated threshold-based revision and contraction. The traditional Darwiche-Pearl postulates for iterated revision continue to hold, as well as two additional postulates that characterize ranking-based revision as a restricted `improvement' operator. We investigate the dual notion of iterated threshold-based belief contraction and provide a new set of postulates for it, characterizing contraction as a restricted 'degrading' operator. (shrink)

Machine learning operates at the intersection of statistics and computer science. This raises the question as to its underlying methodology. While much emphasis has been put on the close link between the process of learning from data and induction, the falsificationist component of machine learning has received minor attention. In this paper, we argue that the idea of falsification is central to the methodology of machine learning. It is commonly thought that machine learning algorithms infer general prediction rules from past (...) observations. This is akin to a statistical procedure by which estimates are obtained from a sample of data. But machine learning algorithms can also be described as choosing one prediction rule from an entire class of functions. In particular, the algorithm that determines the weights of an artificial neural network operates by empirical risk minimization and rejects prediction rules that lack empirical adequacy. It also exhibits a behavior of implicit regularization that pushes hypothesis choice toward simpler prediction rules. We argue that taking both aspects together gives rise to a falsificationist account of artificial neural networks. (shrink)

Fitelson and McCarthy have proposed an accuracy measure for confidence orders which favors probability measures and Dempster-Shafer belief functions as accounts of degrees of belief and excludes ranking functions. Their accuracy measure only penalizes mistakes in confidence comparisons. We propose an alternative accuracy measure that also rewards correct confidence comparisons. Thus we conform to both of William James’ maxims: “Believe truth! Shun error!” We combine the two maxims, penalties and rewards, into one criterion that we call prioritized accuracy optimization. That (...) is, PAO punishes wrong comparisons and rewards right comparisons. And it requires to prioritize being right und avoiding to be wrong in a specific way. Thus PAO is both, a scoring rule and a decision rule. It turns out that precisely confidence orders representable by two-sided ranking functions satisfy PAO. The point is not to argue that PAO is the better accuracy goal. The point is only that ranking theory can also be supported by accuracy considerations. Thus, those considerations by themselves cannot decide about rational formats for degrees of belief, but are part and parcel of an overall normative assessment of those formats. (shrink)

Arguments for A "fair" coin has probability 1/2. There is no physical probability attached to the coin, we can cheat on each toss (by sufficient control). My aim: The coin toss is fine-grained deterministic, but coarsgrained random.

This paper contributes to the investigation of the nature of the relation between probability theory and ranking theory. The paper aims at explaining the structural harmony between the laws of probability theory and those of ranking theory in a way that respects the foundational dualistic attitude developed by Spohn in The Laws of Belief. The paper argues that the so called atomic translation family satisfies the desiderata and does so in the ‘best’ possible way. On the one hand, the atomic (...) translation can be seen as ensuring maximal order agreement between rankings and probability—more would lead to trivialising dualism. On the other hand, the atomic translation also is assumption minimal, i.e., a minimal set of justifiable correspondences or translation principles suffice to derive the translation family, and this result is relatively robust. (shrink)