The material interpretation of conditionals is commonly recognized as involving some paradoxical results. I here argue that the truth functional approach to natural language is the reason for the inadequacy of this material interpretation, since the truth or falsity of some pair of statements ‘p’ and ‘q’ cannot per se be decisive for the truth or falsity of a conditional relation ‘if p then q’. This inadequacy also affects the ability of the overall formal system to establish whether or not (...) arguments involving conditionals are valid. I also demonstrate that the Paradox of Indicative Conditionals does not actually involve a paradox, but instead contains some paralogistic elements that make it appear to be a paradox. The discussion of the paradox in this paper further reveals that the material interpretation of conditionals adversely affects the treatment of disjunctions. -/- Much has been said about these matters in the literature that point in the same direction. However, there seems to be some reluctance against fully complying with the arguments against the truth functional account of conditionals, since many of the alternative accounts rely on the material conditional, or at least on an understanding of the conditional as a function of antecedent and consequent in a similar sense as the material conditional. My argument against truth functionality indicates that it may in general involve similar problems to treat conditionals as such functions, whether one deals with theories of truth, assertability or probability. (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)

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)

Psychological research on people’s understanding of natural language connectives has traditionally used truth table tasks, in which participants evaluate the truth or falsity of a compound sentence given the truth or falsity of its components in the framework of propositional logic. One perplexing result concerned the indicative conditional if A then C which was often evaluated as true when A and C are true, false when A is true and C is false but irrelevant“ (devoid of value) when A is (...) false (whatever the value of C). This was called the “psychological defective table of the conditional.” Here we show that far from being anomalous the “defective” table pattern reveals a coherent semantics for the basic connectives of natural language in a trivalent framework. This was done by establishing participants’ truth tables for negation, conjunction, disjunction, conditional, and biconditional, when they were presented with statements that could be certainly true, certainly false, or neither. We review systems of three-valued tables from logic, linguistics, foundations of quantum mechanics, philosophical logic, and artificial intelligence, to see whether one of these systems adequately describes people’s interpretations of natural language connectives. We find that de Finetti’s (1936/1995) three-valued system is the best approximation to participants’ truth tables. (shrink)

The term ‘hyperconnexive logic’ (or ‘hyperconnexivity’ in general) in relation to a certain logical system was coined by Sylvan to indicate that not only do Boethius’ theses hold in such a system, but also their converses. The plausibility of the latter was questioned by some connexive logicians. Without going into the discussion regarding the plausibility of hyperconnexivity and the converses of Boethius’ theses, this paper proposes a quite simple way to escape the hyperconnexivity within the semantic framework of Wansing-style constructive (...) connexive logics. In particular, we present a working method for escaping hyperconnexivity of constructive connexive logic $${{\textbf{C}}}$$, discuss the problem that creates an obstacle to using the same method in the case of logic $${{\textbf{C3}}}$$ and provide a possible solution to this problem that allows us to construct a logical theory which is similar to $${{\textbf{C3}}}$$ and free from hyperconnexivity. All new logics introduced in this paper are equipped with sound and complete Hilbert-style calculi, and their relationships with other well-known connexive logics are discussed. (shrink)

There is a new Bayesian, or probabilistic, paradigm in the psychology of reasoning, with new psychological accounts of the indicative conditional of natural language. In psychological experiments in this new paradigm, people judge that the probability of the indicative conditional, P(if A then C), is the conditional probability of C given A, P(C | A). In other experiments, participants respond with what has been called the 'de- fective' truth table: they judge that if A then C is true when A (...) holds and C holds, is false when A holds and C does not, and is neither true nor false when A does not hold. We argue that these responses are not 'defective' in any negative sense, as many psychologists have implied. We point out that a number of normative researchers, including de Finetti, have proposed such a table for various coherent interpretations of the third value. We review the relevant general tables in the normative literature, in which there is a third value for A and C and the logically compound forms of the natural language conditional, negation, conjunction, disjunction, and the material conditional. We describe the results of an experiment on which of these tables best describes ordinary people's judgements when the third value is interpreted as indicating uncertainty. (shrink)

Jay Newhard (2021) proposes a novel solution to the Liar Paradox, which he calls the alethic indeterminacy solution to the Liar Paradox. Bradley Armour-Garb (2021) raises a pair of objections to the alethic indeterminacy solution. Both objections are based upon the alethic indeterminacy solution’s alleged commitment that the truth conditions for a Liar Sentence are indeterminate, and therefore not true. In this paper, this alleged commitment is shown to be mistaken. The alethic indeterminacy solution is compatible with maintaining that the (...) truth conditions for a Liar Sentence are a non-truth-functional biconditional which is true, and not indeterminate. Logically complex sentences are typically and standardly treated as truth-functional, and the philosophical literature on non-truth-functionality is diffuse. Two independent accounts of non-truth-functional biconditionals are defended. The first account is based on the claim that indicative conditionals express a non-truth-functional dependency relation between consequent and antecedent. The second account is based upon connected sentences having interdependent truth conditions, which can occur with any polyadic connective. These accounts are fully general, not ad hoc measures. Each account solves both of Armour-Garb’s objections. With both objections met, the alethic indeterminacy solution is shown to be a viable solution to the Liar Paradox worth further development. (shrink)

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

In his seminal paper ‘Truth’, M. Dummett considered negated conditional statements as one of the main motivations for introducing a three-valued logical framework. He left a sketch of an implication connective that, as we observe, shares some intuitions with Wansing-style account for connexivity. In this article, we discuss Dummett’s ‘unfinished’ implication and suggest two possible reconstructions of it. One of them collapses into implication from W. Cooper’s ‘Logic of Ordinary Discourse’ \(\textbf{OL}\) and J. Cantwell’s ‘Logic of Conditional Negation’ \(\textbf{CN}\), whereas (...) the other turns out to be previously unknown implication connective and can be used to obtain a novel logical system, entitled here as \(\textbf{cRM}_\textbf{3}\). As to the technical results, we introduce a sound and complete axiomatic proof-system for \(\textbf{cRM}_\textbf{3}\) and present a theorem for the semantic embedding of \(\textbf{CN}\) into \(\textbf{cRM}_\textbf{3}\). (shrink)

Hempel never met Ramsey, but he knew his work. In his 1958 The Theoretician’s Dilemma: a study in the logic of theory construction, Hempel introduces the term Ramsey sentence, referring to Ramsey’s attempt in Theories to get rid of theoretical terms in formal accounts of scientific theories. In this paper, I draw the attention to another connection between Ramsey’s and Hempel’s works. Hempel’s Deductive-Nomological (DN) account of scientific explanation resembles very closely Ramsey’s account of a certain type of conditional sentences. (...) In the first part of the paper, by introducing a fictional story, I highlight the similarities and differences between the two. In the last part of the paper, I claim that the most relevant difference between Ramsey and Hempel can be used to offer original solutions to Hempel’s Raven Paradox. Two possibilities are presented, arguing that the second, which requires a reconsideration of the formalisation of laws, is the most promising. (shrink)