By and large, the conditional connective in three-valued logic has two different functions. First, by means of a deduction theorem, it can express a specific relation of logical consequence in the logical language itself. Second, it can represent natural language structures such as "if/then'' or "implies''. This chapter surveys both approaches, shows why none of them will typically end up with a three-valued material conditional, and elaborates on connections to probabilistic reasoning.

Imperatives cannot be true or false, so they are shunned by logicians. And yet imperatives can be combined by logical connectives: "kiss me and hug me" is the conjunction of "kiss me" with "hug me". This example may suggest that declarative and imperative logic are isomorphic: just as the conjunction of two declaratives is true exactly if both conjuncts are true, the conjunction of two imperatives is satisfied exactly if both conjuncts are satisfied—what more is there to say? Much more, (...) I argue. "If you love me, kiss me", a conditional imperative, mixes a declarative antecedent ("you love me") with an imperative consequent ("kiss me"); it is satisfied if you love and kiss me, violated if you love but don't kiss me, and avoided if you don't love me. So we need a logic of three -valued imperatives which mixes declaratives with imperatives. I develop such a logic. (shrink)

The aim of this paper is to give a general solution to the paradoxes of the material conditional, including the paradoxes generated by embedded conditionals. The solution consists in a pragmatic reinterpretation of the formal languages of classical logic LK and relevant logic LR as presented in Paoli. In particular I argue that the material conditional in the classical logic LK captures the truth conditions of “if...then”, but ignores certain pragmatic enrichments that are associated to it, while relevant logic LR (...) can give a systematic diagnostic of the cases in which a conditional is pragmatically enriched and those cases in which it is not. This diagnostic shows the reason why the paradoxes seem unacceptable and why they are, nevertheless, truth-preserving. This reinterpretation will also cover the solution that Paoli gives to McGee’s paradoxes of the Modus Ponens. (shrink)

This article focuses on defective conditionals ? namely indicative conditionals whose antecedents are false and whose truth-values therefore cannot be determined. The problem is to decide which formal connective can adequately represent this usage. Classical logic renders defective conditionals true whereas traditional mathematics dismisses them as irrelevant. This difference in treatment entails that, at the propositional level, classical logic validates some sentences that are intuitively false in plane geometry. With two proofs, I show that the same flaw is shared by (...) a family of trivalent logics. I go on to examine the strict conditional and its derivatives. This family is the only one to avoid the faulty inference but it does so without addressing the status of the truth-value assigned to defective conditionals. (shrink)

Classical logic yields counterintuitive results for numerous propositional argument forms. The usual alternatives (modal logic, relevance logic, etc.) generate counterintuitive results of their own. The counterintuitive results create problems—especially pedagogical problems—for informal logicians who wish to use formal logic to analyze ordinary argumentation. This paper presents a system, PL– (propositional logic minus the funny business), based on the idea that paradigmatic valid argument forms arise from justificatory or explanatory discourse. PL– avoids the pedagogical difficulties without sacrificing insight into argument.

Development of decision-support and intelligent agent systems necessitates mathematical descriptions of uncertainty and fuzziness in order to model vagueness. This paper seeks to present an outline of Peirce’s triadic logic as a practical new way to model vagueness in the context of artificial intelligence. Charles Sanders Peirce was an American scientist–philosopher and a great logician whose triadic logic is a culmination of the study of semiotics and the mathematical study of anti-Cantorean model of continuity and infinitesimals. After presenting Peircean semiotics (...) within AI perspective, a mathematical formulation of a Peircean triadic set is given in relationship with classical and fuzzy sets. Using basic logical operators, all possible respective implication operators, bi-equivalence operators, valid rules of inference, and associative, distributive and commutative logical properties are derived and verified through the truth function approach. In order to suggest practical directions, aggregation operators for Peirce’s triadic logic have been formulated. A mathematical formulation of a medical diagnostic problem and ER diagram of a library management system using Peirce’s triadic relation show potential for further applications of the proposed triadic set and triadic logic. Alongside, a classical AI game—The Wumpus World—is implemented to show practical efficacy in comparison with binary implementation. Besides giving some preliminary formulations for trichotomous set theory and definition of finite automaton, development of hybrid architectures for intelligent agents and evolutionary computations are discussed as potential practical avenues for Peirce’s triadic logic. (shrink)

ABSTRACT A trivalent theory of indicative conditionals automatically enforces Stalnaker's thesis – the equation between probabilities of conditionals and conditional probabilities. This result holds because the trivalent semantics requires, for principled reasons, a modification of the ratio definition of conditional probability in order to accommodate the possibility of undefinedness. I explain how this modification is motivated and how it allows the trivalent semantics to avoid a number of well-known triviality results, in the process clarifying why these results hold for many (...) bivalent theories. In short, the slew of triviality results published in the last 40-odd years need not be viewed as an argument against Stalnaker's thesis: it can be construed instead as an argument for abandoning the bivalent requirement that indicative conditionals somehow be assigned a truth-value in worlds in which their antecedents are false. (shrink)

Thought: A Journal of Philosophy, Volume 10, Issue 1, Page 42-52, March 2021.

How do people make deductions? The orthodox view in psychology is that they use formal rules of inference like those of a “natural deduction” system.Deductionargues that their logical competence depends, not on formal rules, but on mental models. They construct models of the situation described by the premises, using their linguistic knowledge and their general knowledge. They try to formulate a conclusion based on these models that maintains semantic information, that expresses it parsimoniously, and that makes explicit something not directly (...) stated by any premise. They then test the validity of the conclusion by searching for alternative models that might refute the conclusion. The theory also resolves long-standing puzzles about reasoning, including how nonmonotonic reasoning occurs in daily life. The book reports experiments on all the main domains of deduction, including inferences based on prepositional connectives such as “if” and “or,” inferences based on relations such as “in the same place as,” inferences based on quantifiers such as “none,” “any,” and “only,” and metalogical inferences based on assertions about the true and the false. Where the two theories make opposite predictions, the results confirm the model theory and run counter to the formal rule theories. Without exception, all of the experiments corroborate the two main predictions of the model theory: inferences requiring only one model are easier than those requiring multiple models, and erroneous conclusions are usually the result of constructing only one of the possible models of the premises. (shrink)

This paper presents a weak Kleene approach to conditionals that preserves some salient formal features of conditionals, particularly their interdefinability with Boolean logical connectives. I argue that such an approach fares better than other proposed weak logics of conditionals in this regard. In particular, it fares better than the logics proposed by Cooper, Cantwell, Farrell, De Finetti, Égré, Rossi, and Sprenger.

Whether assent ("acceptance") and dissent ("rejection") are thought of as speech acts or as propositional attitudes, the leading idea of rejectivism is that a grasp of the distinction between them is prior to our understanding of negation as a sentence operator, this operator then being explicable as applying to A to yield something assent to which is tantamount to dissent from A. Widely thought to have been refuted by an argument of Frege's, rejectivism has undergone something of a revival in (...) recent years, especially in writings by Huw Price and Timothy Smiley. While agreeing that Frege's argument does not refute the position, we shall air some philosophical qualms about it in Section 5, after a thorough examination of the formal issues in Sections 1-4. This discussion draws on - and seeks to draw attention to - some pertinent work of Kent Bendall in the 1970s. (shrink)

We explore in an experimental spirit the prospects for extending classical propositional logic with a new operator P intended to be interpreted when prefixed to a formula as saying that formula in question is at least partly true. The paradigm case of something which is, in the sense envisaged, false though still "partly" true is a conjunction one of whose conjuncts is false while the other is true. Ideally, we should like such a logic to extend classical logic - or (...) any fragment thereof under consideration - conservatively, to be closed under uniform substitution (of arbitrary formulas for sentence letters or propositional variables), and to allow the substitutivity of provably equivalent formulas salva provabilitate. To varying degrees, we experience some difficulties only with this last ('congruentiality') desideratum in the two four-valued logics we end up giving our most extended consideration to. (shrink)

This paper revisits Buridan’s Bridge paradox (Sophismata, chapter 8, Sophism 17), itself close kin to the Liar paradox, a version of which also appears in Bradwardine’s Insolubilia. Prompted by the occurrence of the paradox in Cervantes’s Don Quixote, I discuss and compare four distinct solutions to the problem, namely Bradwardine’s “just false” conception, Buridan’s “contingently true/false” theory, Cervantes’s “both true and false” view, and then the “neither true simpliciter nor false simpliciter” account proposed more recently by Jacquette. All have in (...) common to accept that the Bridge expresses a truth-apt proposition, but only the latter three endorse the transparency of truth. Against some previous commentaries I first show that Buridan’s solution is fully compliant with an account of the paradox within classical logic. I then argue that Cervantes’s insights, as well as Jacquette’s treatment, are both supportive of a dialetheist account, and Jacquette’s in particular of the strict-tolerant account of truth. I defend dialetheist intuitions (whether in LP or ST guise) against two objections: one concerning the future, the other concerning the alleged simplicity of the Bridge compared to the Liar. (shrink)

This paper explores trivalent truth conditions for indicative conditionals, examining the “defective” truth table proposed by de Finetti and Reichenbach. On their approach, a conditional takes the value of its consequent whenever its antecedent is true, and the value Indeterminate otherwise. Here we deal with the problem of selecting an adequate notion of validity for this conditional. We show that all standard validity schemes based on de Finetti’s table come with some problems, and highlight two ways out of the predicament: (...) one pairs de Finetti’s conditional with validity as the preservation of non-false values, but at the expense of Modus Ponens; the other modifies de Finetti’s table to restore Modus Ponens. In Part I of this paper, we present both alternatives, with specific attention to a variant of de Finetti’s table proposed by Cooper and Cantwell. In Part II, we give an in-depth treatment of the proof theory of the resulting logics, DF/TT and CC/TT: both are connexive logics, but with significantly different algebraic properties. (shrink)

In Part I of this paper, we identified and compared various schemes for trivalent truth conditions for indicative conditionals, most notably the proposals by de Finetti and Reichenbach on the one hand, and by Cooper and Cantwell on the other. Here we provide the proof theory for the resulting logics DF/TT and CC/TT, using tableau calculi and sequent calculi, and proving soundness and completeness results. Then we turn to the algebraic semantics, where both logics have substantive limitations: DF/TT allows for (...) algebraic completeness, but not for the construction of a canonical model, while CC/TT fails the construction of a Lindenbaum-Tarski algebra. With these results in mind, we draw up the balance and sketch future research projects. (shrink)

What is logical relevance? Anderson and Belnap say that the “modern classical tradition [,] stemming from Frege and Whitehead-Russell, gave no consideration whatsoever to the classical notion of relevance.” But just what is this classical notion? I argue that the relevance tradition is implicitly most deeply concerned with the containment of truth-grounds, less deeply with the containment of classes, and least of all with variable sharing in the Anderson–Belnap manner. Thus modern classical logicians such as Peirce, Frege, Russell, Wittgenstein, and (...) Quine are implicit relevantists on the deepest level. In showing this, I reunite two fields of logic which, strangely from the traditional point of view, have become basically separated from each other: relevance logic and diagram logic. I argue that there are two main concepts of relevance, intensional and extensional. The first is that of the relevantists, who overlook the presence of the second in modern classical logic. The second is the concept of truth-ground containment as following from in Wittgenstein’s Tractatus. I show that this second concept belongs to the diagram tradition of showing that the premisses contain the conclusion by the fact that the conclusion is diagrammed in the very act of diagramming the premisses. I argue that the extensional concept is primary, with at least five usable modern classical filters or constraints and indefinitely many secondary intensional filters or constraints. For the extensional concept is the genus of deductive relevance, and the filters define species. Also following the Tractatus, deductive relevance, or full truth-ground containment, is the limit of inductive relevance, or partial truth-ground containment. Purely extensional inductive or partial relevance has its filters or species too. Thus extensional relevance is more properly a universal concept of relevance or summum genus with modern classical deductive logic, relevantist deductive logic, and inductive logic as its three main domains. (shrink)

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, in which (...) the middle value acts like one of the classical values). For $st$, the schemes in question are the Boolean normal schemes that are either monotonic or collapsible. (shrink)