Chancy modus ponens is the following inference scheme: ‘probably φ’, ‘if φ, then ψ’, therefore, ‘probably ψ’. I argue that Chancy modus ponens is invalid in general. I further argue that the invalidity of Chancy modus ponens sheds new light on the alleged counterexample to modus ponens presented by McGee. I close by observing that, although Chancy modus ponens is invalid in general, we can recover a restricted sense in which (...) this scheme of inference is valid. (shrink)

The paper is concerned with a logical difficulty which Lionel Shapiro’s deflationist theory of logical consequence (as well as the author’s favoured, non-deflationist theory) gives rise to. It is argued that Shapiro’s non-contractive approach to solving the difficulty, although correct in its broad outlines, is nevertheless extremely problematic in some of its specifics, in particular in its failure to validate certain intuitive rules and laws associated with the principle of modus ponens. An alternative non-contractive theory is offered which (...) does not suffer from the same problem. (shrink)

If modus ponens is valid, then you should take up smoking.

Is modus ponens valid for the indicative conditional? McGee [1985] famously presents several alleged counterexamples to this inference rule. More recently, Kolodny and MacFarlane [2010] and Willer [2010] argue that modus ponens is unreliable in certain hypothetical contexts. However, none of these attacks undermines an informational conception of logic on which modus ponens is valid.

There is a renewed debate about modus ponens. Strikingly, the recent counterexamples in Cantwell, Dreier and MacFarlane and Kolodny are generated by restricted readings of the ‘if’-clause. Moreover, it can be argued on general grounds that the restrictor view of conditionals developed in Kratzer and Lewis leads to counterexamples to modus ponens. This paper provides a careful analysis of modus ponens within the framework of the restrictor view. Despite appearances to the contrary, there is (...) a robust sense in which modus ponens is valid, owing to the fact that conditionals do not only allow for restricted readings but have bare interpretations, too. (shrink)

In the recent paper “Naive modus ponens”, Zardini presents some brief considerations against an approach to semantic paradoxes that rejects the transitivity of entailment. The problem with the approach is, according to Zardini, that the failure of a meta-inference closely resembling modus ponens clashes both with the logical idea of modus ponens as a valid inference and the semantic idea of the conditional as requiring that a true conditional cannot have true antecedent and false (...) consequent. I respond on behalf of the non-transitive approach. I argue that the meta-inference in question is independent from the logical idea of modus ponens, and that the semantic idea of the conditional as formulated by Zardini is inadequate for his purposes because it is spelled out in a vocabulary not suitable for evaluating the adequacy of the conditional in semantics for non-transitive entailment. I proceed to generalize the semantic idea of the conditional and show that the most popular semantics for non-transitive entailment satisfies the new formulation. (shrink)

After some motivating remarks in Section 1, in Section 2 we show how to replace an axiomatic basis for any one of a broad range of sentential logics having finitely many axiom schemes and Modus Ponens as the sole proper rule, by a basis with the same axiom schemes and finitely many one-premiss rules. Section 3 mentions some questions arising from this replacement procedure , explores another such procedure, and discusses some aspects of the consequence relations associated with (...) the different axiomatizations in play. Several open problems are mentioned. An appendix briefly treats the issue of a similar ‘at most one-premiss rules’ reformulation of proof systems with sequent-to-sequent rules. (shrink)

Considering the instability of nonlinear dynamics, the deductive inference rule Modus ponens itself is not enough to guarantee the validity of reasoning sequences in the real physical world, and similar results cannot necessarily be obtained from similar causes. Some kind of stability hypothesis should be added in order to draw meaningful conclusions. Hence, the uncertainty of deductive inference appears to be like that of inductive inference, and the asymmetry between deduction and induction becomes unrecognizable such as to undermine (...) the basis for the fundamental cleavage between analytic truth and synthetic truth, as W. V. O. Quine pointed out. Induction is not inferior to deduction from a pragmatic point of view. (shrink)

The precedent studies on the validity of Modus ponens and Modus tollens have been carried out with most regard to a major type of conditionals in which the conditional clause is a sufficient condition for the main clause. But we sometimes, in natural language arguments, find other types of conditionals in which the conditional clause is a necessary or necessary and sufficient condition for the main clause. In this paper I reappraise, on the basis of new definitions (...) of Modus ponens and Modus tollens, their validity/invalidity in natural language arguments in consideration of all types of conditionals. (shrink)

There are narrowest bounds for P(h) when P(e) = y and P(h/e) = x, which bounds collapse to x as y goes to 1. A theorem for these bounds -- bounds for probable modus ponens -- entails a principle for updating on possibly uncertain evidence subject to these bounds that is a generalization of the principle for updating by conditioning on certain evidence. This way of updating on possibly uncertain evidence is appropriate when updating by ’probability kinematics’ or (...) ’Jeffrey-conditioning’ is, and apparently in countless other cases as well. A more complicated theorem due to Karl Wagner -- bounds for probable modus tollens -- registers narrowest bounds for P(not h) when P(not e) = y and P(e/h) = x. This theorem serves another principle for updating on possibly uncertain evidence that might be termed ’contraditioning’, though it is for a way of updating that seems in practice to be frequently not appropriate. It is definitely not a way of putting down a theory -- for example, a random-chanc. (shrink)

ABSTRACT: This paper traces the earliest development of the most basic principle of deduction, i.e. modus ponens (or Law of Detachment). ‘Aristotelian logic’, as it was taught from late antiquity until the 20th century, commonly included a short presentation of the argument forms modus (ponendo) ponens, modus (tollendo) tollens, modus ponendo tollens, and modus tollendo ponens. In late antiquity, arguments of these forms were generally classified as ‘hypothetical syllogisms’. However, Aristotle did not (...) discuss such arguments, nor did he call any arguments ‘hypothetical syllogisms’. The Stoic indemonstrables resemble the modus ponens/tollens arguments. But the Stoics never called them ‘hypothetical syllogisms’; nor did they describe them as ponendo ponens, etc. The tradition of the four argument forms and the classification of the arguments as hypothetical syllogisms hence need some explaining. In this paper, I offer some explanations by tracing the development of certain elements of Aristotle’s logic via the early Peripatetics to the logic of later antiquity. I consider the questions: How did the four argument forms arise? Why were there four of them? Why were arguments of these forms called ‘hypothetical syllogisms’? On what grounds were they considered valid? I argue that such arguments were neither part of Aristotle’s dialectic, nor simply the result of an adoption of elements of Stoic logic, but the outcome of a long, gradual development that begins with Aristotle’s logic as preserved in his Topics and Prior Analytics; and that, as a result, we have a Peripatetic logic of hypothetical inferences which is a far cry both from Stoic logic and from classical propositional logic, but which sports a number of interesting characteristics, some of which bear a cunning resemblance to some 20th century theories. (shrink)

Recently, there has been a shift away from traditional truth-conditional accounts of meaning towards non-truth-conditional ones, e.g., expressivism, relativism and certain forms of dynamic semantics. Fueling this trend is some puzzling behavior of modal discourse. One particularly surprising manifestation of such behavior is the alleged failure of some of the most entrenched classical rules of inference; viz., modus ponens and modus tollens. These revisionary, non-truth-conditional accounts tout these failures, and the alleged tension between the behavior of modal (...) vocabulary and classical logic, as data in support of their departure from tradition, since the revisionary semantics invalidate some of these patterns. I, instead, offer a semantics for modality with the resources to accommodate the puzzling data while preserving classical logic, thus affirming the tradition that modals express ordinary truth-conditional content. My account shows that the real lesson of the apparent counterexamples is not the one the critics draw, but rather one they missed: namely, that there are linguistic mechanisms, reflected in the logical form, that affect the interpretation of modal language in a context in a systematic and precise way, which have to be captured by any adequate semantic account of the interaction between discourse context and modal vocabulary. The semantic theory I develop specifies these mechanisms and captures precisely how they affect the interpretation of modals in a context, and do so in a way that both explains the appearance of the putative counterexamples and preserves classical logic. (shrink)

This article concerns the structure of defeasible arguments like: 'If Bob has red spots, Bob has the measles; Bob has red spots; therefore Bob has the measles.' The issue is whether such arguments have the form of modus ponens or not. Either way there is a problem. If they don't have the form of modus ponens, the common opinion to the contrary taught in leading logic textbooks is wrong. But if they do have the form of (...) modus ponens, doubts are raised about the conventional dogma that all arguments having the form of modus ponens are deductively valid. By carefully examining arguments on both sides of the issue, reasonable doubts are raised about the view that all arguments having a modus ponens form are valid. (shrink)

The compositional structure of language might have led one to expect that a proper analysis of simple conditionals would have been adequate to determine the analysis of iterated conditionals. But McGee has presented an interesting group of examples that shows that this is not so for indicative conditionals. The examples are particularly arresting since they appear to show that modus ponens does not hold as a generally valid rule of inference for conditionals in natural language.

Modus ponens (from A and “if A then C” infer C) is one of the most basic inference rules. The probabilistic modus ponens allows for managing uncertainty by transmitting assigned uncertainties from the premises to the conclusion (i.e., from P(A) and P(C|A) infer P(C)). In this paper, we generalize the probabilistic modus ponens by replacing A by the conditional event A|H. The resulting inference rule involves iterated conditionals (formalized by conditional random quantities) and propagates (...) previsions from the premises to the conclusion. Interestingly, the propagation rules for the lower and the upper bounds on the conclusion of the generalized probabilistic modus ponens coincide with the respective bounds on the conclusion for the (non-nested) probabilistic modus ponens. (shrink)

In a recent pair of publications, Richard Bradley has offered two novel no-go theorems involving the principle of Preservation for conditionals, which guarantees that one’s prior conditional beliefs will exhibit a certain degree of inertia in the face of a change in one’s non-conditional beliefs. We first note that Bradley’s original discussions of these results—in which he finds motivation for rejecting Preservation, first in a principle of Commutativity, then in a doxastic analogue of the rule of modus ponens (...) —are problematic in a significant number of respects. We then turn to a recent U-turn on his part, in which he winds up rescinding his commitment to modus ponens, on the grounds of a tension with the rule of Import-Export for conditionals. Here we offer an important positive contribution to the literature, settling the following crucial question that Bradley leaves unanswered: assuming that one gives up on full-blown modus ponens on the grounds of its incompatibility with Import-Export, what weakened version of the principle should one be settling for instead? Our discussion of the issue turns out to unearth an interesting connection between epistemic undermining and the apparent failures of modus ponens in McGee’s famous counterexamples. (shrink)

McGee argues that it is sometimes reasonable to accept both x and x-> without accepting y->z, and that modus ponens is therefore invalid for natural language indicative conditionals. Here, we examine McGee's counterexamples from a Bayesian perspective. We argue that the counterexamples are genuine insofar as the joint acceptance of x and x-> at time t does not generally imply constraints on the acceptability of y->z at t, but we use the distance-based approach to Bayesian learning to show (...) that applications of modus ponens are nevertheless guaranteed to be successful in an important sense. Roughly, if an agent becomes convinced of the premises of a modus ponens argument, then she should likewise become convinced of the argument's conclusion. Thus we take McGee's counterexamples to disentangle and reveal two distinct ways in which arguments can convince. Any general theory of argumentation must take stock of both. (shrink)

“Weak relevant model structures” (wr-ms) are defined on “weak relevant matrices” by generalizing Brady’s model structure ${\mathcal{M}_{\rm CL}}$ built upon Meyer’s Crystal matrix CL. It is shown how to falsify in any wr-ms the Generalized Modus Ponens axiom and similar schemes used to derive Curry’s Paradox. In the last section of the paper we discuss how to extend this method of falsification to more general schemes that could also be used in deriving Curry’s Paradox.

That one person's modus ponens is another's modus tollens is the bane of philosophy because it strips many philosophical arguments of their persuasive force. The problem is that philosophical arguments become mere pantomemes: arguments that are reasonable to resist simply by denying the conclusion. Appeals to proof, intuition, evidence, and truth fail to alleviate the problem. Two broad strategies, however, do help in certain circumstances: an appeal to normal informal standards of what is reasonable (nisowir) and argument (...) by interpretation. The method of explication features prominently in both strategies, and the paper extends this method to apply to nisowir, introducing the concept of canonical explication. The paper illustrates the two strategies with examples of arguments from formal epistemology and suggests that an appeal to nisowir might help to defend against philosophical scepticism by shifting the burden of proof to the sceptic. (shrink)

It is commonly accepted that those embedded conditionals of the type "if A, then if B, then C" we do understand, we understand as equivalent to sentences without embedded conditionals. This reduction is in classical logic achieved with the use of laws of exportation and importation. V. McGee even presents counterexamples to modus ponens which are based on the classical treatment of embedded conditionals and proposes to trade the validity of modus ponens for the validity of (...) laws of importation and exportation. It is argued that for a large class of indicative conditionals the laws of exportation and importation are invalid. With the help of Stalnaker's selection function theory of conditionals and the distinction between valid and reasonable inferences it is shown that modus ponens is valid but can be unreasonable, whereas laws of importation and exportation are invalid, but still reasonable. (shrink)

There are two primary arguments against scientific realism, one pertaining to underdetermination, the other to the history of science. While these arguments are usually treated as altogether distinct, P. Kyle Stanford's ‘problem of unconceived alternatives’ constitutes one kind of synthesis: I propose that Stanford's argument is best understood as a broad modus ponens underdetermination argument, into which he has inserted a unique variant of the historical pessimistic induction. After articulating three criticisms against Stanford's argument and the evidence that (...) he offers, I contend that, as it stands, Stanford's argument poses no threat to contemporary scientific realism. Nonetheless, upon identifying two useful insights present in Stanford's general strategy, I offer an alternative variant of the modus ponens underdetermination argument, one that, although historically informed by science, requires no inductive premises. I contend that this non-inductive but historically informed variant of the modus ponens clarifies and considerably strengthens the case against scientific realism. (shrink)

The suppression of the Modus Ponens inference is described as a loss of confidence in the conclusion C of an argument “If A1 then C; If A2 then C; A1” where A2 is a requirement for C to happen. It is hypothesised that this loss of confidence is due to the derivation of the conversational implicature “there is a chance that A2 might not be satisfied”, and that different syntactic introductions of the requirement A2 (e.g., “If C then (...) A2”) will lead to various frequencies in the derivation of this implicature, according to previous studies in the field of causal explanation. An experiment is conducted, whose results support those claims. Results are discussed in the light of the Mental Logic and Mental Model theories, as well as in the light of the pragmatic approach to uncertain reasoning. (shrink)

The suppression of the Modus Ponens inference is described as a loss of confidence in the conclusion C of an argument ''If A1 then C; If A2 then C; A1'' where A2 is a requirement for C to happen. It is hypothesised that this loss of confidence is due to the derivation of the conversational implicature ''there is a chance that A2 might not be satisfied'', and that different syntactic introductions of the requirement A2 (e.g., ''If C then (...) A2'') will lead to various frequencies in the derivation of this implicature, according to previous studies in the field of causal explanation. An experiment is conducted, whose results support those claims. Results are discussed in the light of the Mental Logic and Mental Model theories, as well as in the light of the pragmatic approach to uncertain reasoning. (shrink)

This paper presents an adaptive logic enhancement of conditional logics of normality that allows for defeasible applications of Modus Ponens to conditionals. In addition to the possibilities these logics already offer in terms of reasoning about conditionals, this way they are enriched by the ability to perform default inferencing. The idea is to apply Modus Ponens defeasibly to a conditional and a fact on the condition that it is ‘safe' to do so concerning the factual and (...) conditional knowledge at hand. It is for instance not safe if the given information describes exceptional circumstances: although birds usually fly, penguins are exceptional to this rule. The two adaptive standard strategies are shown to correspond to different intuitions, a skeptical and a credulous reasoning type, which manifest themselves in the handling of so-called floating conclusions. (shrink)

Lattice BCK logic is the expansion of the well known Meredith implicational logic BCK expanded with lattice conjunction and disjunction. Although its natural axiomatization has three rules named modus ponens, ∨‐rule and ∧‐rule, we show that we can give an equivalent presentation with just modus ponens and ∧‐rule, however it is impossible to obtain an equivalent presentation with modus ponens as unique rule. In this paper we study and characterize all axiomatic extensions of lattice (...) BCK logic with modus ponens as unique rule. We obtain an infinite chain of proper axiomatic extensions with this property. Moreover, we prove that there is no weakest axiomatic extension of Lattice BCK‐logic admitting modus ponens as unique rule. (shrink)

En este trabajo se presenta una explicación para el problema de las versiones abstractas de la tarea de selección de las cuatro tarjetas de Peter Wason: los discretos resultados de los participantes cuando se enfrentan a ellas. Nuestra explicación apunta a que los sujetos no comprenden la regla de la tarea como un condicional, sino como un bicondicional, provocando tal circunstancia que no elijan las tarjetas correctas. Santamaría planteó una objeción para todo enfoque que defienda que en la tarea de (...) selección se produce una interpretación bicondicional de la regla, pero nosotros también respondemos aquí a dicha objeción atendiendo a la primacía que en el razonamiento humano puede tener la regla lógica del modus ponens. Igualmente, exponemos un estudio, basado en diálogos de seminario tutoriales al modo socrático, realizado por nosotros con el propósito de comprobar si nuestra explicación puede ser viable y comentamos los resultados obtenidos. In this paper, we present an explanation for the problem of the abstract versions of Peter Wason’s four-card selection task: modest subjects’ results when they are confronted with these tasks. Our explanation poses that individuals do not comprehend the task rule as a conditional sentence, but as a biconditional one, causing that subjects do not choose the correct cards. Santamaría presented an objection for any approach that suggests a biconditional interpretation in the task selection. In this work, we discuss this objection based on the apparent primacy of a logical rule in human reasoning: modus ponens. Additionally, we present a study based on Socratic dialogue seminars with a tutorial style, developed by us, to check whether our explanation is viable or not, and discuss the results achieved. (shrink)

The doctrine of double effect (DOE) has its origins in Roman Catholic thought and has been held to have widespread applications in bioethics. Its applications range over issues of maternal-fetal conflict, organ donation and transplant, euthanasia, and resource allocation, among other controversial issues. Recently, Joseph Boyle, the foremost proponent of the DOE over the past few decades, has argued that the DOE is required by the absolutist context of the Catholic tradition, and, further, that anyone who rejects this particular context (...) is not entitled to use the doctrine. In this essay, I will focus exclusively on the intention condition of the DOE and its central distinction, i.e., intention/side effect. I will proceed by considering in turn (1) Boyle's argument that the absolutist moral framework of the Catholic tradition requires the intention/side effect distinction; (2) the ways in which that framework is made vulnerable by this requirement; and (3) just why the DOE should be viable even outside of the Catholic tradition if it turns out that a feature of (l) is correct and the challenges of (2) can be met. (shrink)

This paper studies, with techniques ofAlgebraic Logic, the effects of putting a bound on the cardinality of the set of side formulas in the Deduction Theorem, viewed as a Gentzen-style rule, and of adding additional assumptions inside the formulas present in Modus Ponens, viewed as a Hilbert-style rule. As a result, a denumerable collection of new Gentzen systems and two new sentential logics have been isolated. These logics are weaker than the positive implicative logic. We have determined their (...) algebraic models and the relationships between them, and have classified them according to several standard criteria of Abstract Algebraic Logic. One of the logics is protoalgebraic but neither equivalential nor weakly algebraizable, a rare situation where very few natural examples were hitherto known. In passing we have found new, alternative presentations of positive implicative logic, both in Hilbert style and in Gentzen style, and have characterized it in terms of the restricted Deduction Theorem: it is the weakest logic satisfying Modus Ponens and the Deduction Theorem restricted to at most 2 side formulas. The algebraic part of the work has lead to the class of quasi-Hilbert algebras, a quasi-variety of implicative algebras introduced by Pla and Verdú in 1980, which is larger than the variety of Hilbert algebras. Its algebraic properties reflect those of the corresponding logics and Gentzen systems. (shrink)

[full article, abstract in English; only abstract in Lithuanian] This paper proposes a new pragmatic interpretation of the Frege–Geach problem and presents a possible solution using a model of ascriptive legal language. The first section includes the definition of the Frege–Geach problem. In the second section, I analyze the content of Geach’s critical argument against prescriptivism in ethics. I discuss what Geach means by ascriptivism, why he mixes it with prescriptivism, and why a particular article by Herbert Hart became the (...) subject of criticism by Geach. The third section proposes a possible solution to the Frege–Geach problem based on the explication of the assertoric force of ascriptive legal utterances and the performativity of legal language. (shrink)