We explore the technical details and historical evolution of Charles Peirce's articulation of a truth table in 1893, against the background of his investigation into the truth-functional analysis of propositions involving implication. In 1997, John Shosky discovered, on the verso of a page of the typed transcript of Bertrand Russell's 1912 lecture on ?The Philosophy of Logical Atomism? truth table matrices. The matrix for negation is Russell's, alongside of which is the matrix for material implication in the hand of Ludwig (...) Wittgenstein. It is shown that an unpublished manuscript identified as composed by Peirce in 1893 includes a truth table matrix that is equivalent to the matrix for material implication discovered by John Shosky. An unpublished manuscript by Peirce identified as having been composed in 1883?1884 in connection with the composition of Peirce's ?On the Algebra of Logic: A Contribution to the Philosophy of Notation? that appeared in the American Journal of Mathematics in 1885 includes an example of an indirect truth table for the conditional. (shrink)

In this paper I argue that a truth functional account of conditional statements ‘if A then B’ not only is inadequate, but that it eliminates the very conditionality expressed by ‘if’. Focusing only on the truth-values of the statements ‘A’ and ‘B’ and different combinations of these, one is bound to miss out on the conditional relation expressed between them. But this is not a flaw only of truth functionality and the material conditional. All approaches that try to treat conditionals (...) as mere functions of their antecedents and consequents will end up in some sort of logical atomism where causal matters simply are reduced to the joint occurrence of A and B. What we need is a non-extensional approach to conditionals that can account for hypotheticality, potentiality, and dependency, none of which can be understood by looking to the antecedent or consequent per se. (shrink)

In this paper I present some of Robert N. McLaughlin's critique of a truth functional approach to conditionals as it appears in his book On the Logic of Ordinary Conditionals. Based on his criticism I argue that the basic principles of logic together amount to epistemological and metaphysical implications that can only be accepted from a logical atomist perspective. Attempts to account for conditional relations within this philosophical framework will necessarily fail. I thus argue that it is not truth functionality (...) as such that is the problem, but the philosophical foundation of modern logic. (shrink)

INTRODUCTION The main purpose of this work is to provide an English translation of and commentary on a recently published Arabic text dealing with ...

Most instantiations of the inference ‘y; so if x, y’ seem intuitively odd, a phenomenon known as one of the paradoxes of the material conditional. A common explanation of the oddity, endorsed by Mental Model theory, is based on the intuition that the conclusion of the inference throws away semantic information. We build on this explanation to identify two joint conditions under which the inference becomes acceptable: (a) the truth of x has bearings on the relevance of asserting y; and (...) (b) the speaker can reasonably be expected not to be in a position to assume that x is false. We show that this dual pragmatic criterion makes accurate predictions, and contrast it with the criterion defined by the mental model theory of conditionals, which we show to be inadequate. (shrink)

We present a series of arguments for logical nativism, focusing mainly on the meaning of disjunction in human languages. We propose that all human languages are logical in the sense that the meaning of linguistic expressions corresponding to disjunction (e.g. English or , Chinese huozhe, Japanese ka ) conform to the meaning of the logical operator in classical logic, inclusive- or . It is highly implausible, we argue, that children acquire the (logical) meaning of disjunction by observing how adults use (...) disjunction. Findings from studies of child language acquisition and from cross-linguistic research invite the conclusion that children do not learn to be logical—it comes naturally to them. (shrink)

The first known statements of the deduction theorems for the first-order predicate calculus and the classical sentential logic are due to Herbrand [8] and Tarski [14], respectively. The present paper contains an analysis of closure spaces associated with those sentential logics which admit various deduction theorems. For purely algebraic reasons it is convenient to view deduction theorems in a more general form: given a sentential logic C (identified with a structural consequence operation) in a sentential language I, a quite arbitrary (...) set P of formulas of I built up with at most two distinct sentential variables p and q is called a uniform deduction theorem scheme for C if it satisfies the following condition: for every set X of formulas of I and for any formulas and , C(X{{a}}) iff P(, ) AC(X). [P(, ) denotes the set of formulas which result by the simultaneous substitution of for p and for q in all formulas in P]. The above definition encompasses many particular formulations of theorems considered in the literature to be deduction theorems. Theorem 1.3 gives necessary and sufficient conditions for a logic to have a uniform deduction theorem scheme. Then, given a sentential logic C with a uniform deduction theorem scheme, the lattices of deductive filters on the algebras A similar to the language of C are investigated. It is shown that the join-semilattice of finitely generated (= compact) deductive filters on each algebra A is dually Brouwerian. (shrink)

We propose a new schema for the deduction theorem and prove that the deductive system S of a prepositional logic L fulfills the proposed schema if and only if there exists a finite set A(p, q) of propositional formulae involving only prepositional letters p and q such that A(p, p) L and p, A(p, q) s q.

This article features long-sought proofs with intriguing properties (such as the absence of double negation and the avoidance of lemmas that appeared to be indispensable), and it features the automated methods for finding them. The theorems of concern are taken from various areas of logic that include two-valued sentential (or propositional) calculus and infinite-valued sentential calculus. Many of the proofs (in effect) answer questions that had remained open for decades, questions focusing on axiomatic proofs. The approaches we take are of (...) added interest in that all rely heavily on the use of a single program that offers logical reasoning, William McCune's automated reasoning program OTTER. The nature of the successes and approaches suggests that this program offers researchers a valuable automated assistant. This article has three main components. First, in view of the interdisciplinary nature of the audience, we discuss the means for using the program in question (OTTER), which flags, parameters, and lists have which effects, and how the proofs it finds are easily read. Second, because of the variety of proofs that we have found and their significance, we discuss them in a manner that permits comparison with the literature. Among those proofs, we offer a proof shorter than that given by Meredith and Prior in their treatment of ukasiewicz's shortest single axiom for the implicational fragment of two-valued sentential calculus, and we offer a proof for the ukasiewicz 23-letter single axiom for the full calculus. Third, with the intent of producing a fruitful dialogue, we pose questions concerning the properties of proofs and, even more pressing, invite questions similar to those this article answers. (shrink)

As with mathematics, logic is easier to do if its symbols and their rules are better. In a graphic way, the logic symbols introduced in thís paper show their truth-table values, their composite truth-functions, and how to say them as either ?or? or ?if ? then? propositions. Simple rules make the converse, add or remove negations, and resolve propositions.

The ninth included paper is now fully, formally published with volume number and page numbers, and the second page of the Table of Contents reflects that change, as well. -/- Following Popper on the measure of content, we will combine the concept of logical probability, developed in the nineteenth century, with logical form, and we will answer some objections of Elias to the systematization of Popper's idea by Bar-Hillel and Carnap. We were led along this path by a novel by (...) Isaac Asimov, the biochemist, medical school professor, science fiction writer, and popular science writer—a true polymath with over 400 books to his credit. Elias was concerned that Bar-Hillel and Carnap's theory of semantic content had no philosophical import, no unique properties, and no applications. We will suggest three areas of philosophical import, a unique property based on differences as explained by Peter Milne, and some applications in the general area of abstracting or summarization. We will also suggest that automated language-to-logical-form converters are feasible, necessary for the achievement of various ends, and desirable for the achievement of other ends. In the entire discussion of logical form, we will rely entirely on modern, classical (i.e., two-valued, truth-functional) logic alone, including that most vexatious of connectives, "if." We will close our work with an argument referred to in favor of > from our earlier work, in particular, and truth-functionality, more generally. The connection between the material on content in the first part of this book and the material on a truth-functional approach to logical form in the second part of this book is that the former material presupposes that a certain subset of declarative language is, in fact, truth-functional, a view that is particularly hard to defend for "if," and it is just that defense that is taken up in the second part. This book consists of ten published pieces, as well as three introductory units, and three concluding sections or units. (shrink)

This paper presents a unified, more-or-less complete, and largely pragmatic theory of indicative conditionals as they occur in natural language, which is entirely truth-functional and does not involve probability. It includes material implication as a special—and the most important—case, but not as the only case. The theory of conditional elements, as we term it, treats if-statements analogously to the more familiar and less controversial other truth-functional compounds, such as conjunction and disjunction.

Nested conditionals are indeed vexatious. This 'counterexample' to Modus Ponens relies for its apparent integrity on implicit premises in the background, which once disclosed show how and that this is not a counterexample at all. Modus Ponens is perhaps the most straightforward rule of all and has no counterexamples that I am aware of at all.

This paper applies the theory of conditional elements to mathematical discourse, rather than ordinary natural-language discourse, in which latter context the theory was first introduced.

This article discusses what is sometimes called the third paradox of material implication. Readers choosing to download this piece should please be so kind as to respect the author's wishes and download the published corrigendum as well, which is available via the "other links" tab.

Traditionally, imperatives have been handled with deontic logics, not the logic of propositions which bear truth values. Yet, an imperative is issued by the speaker to cause [stay] actions which change the state of affairs, which is, in turn, described by propositions that bear truth values. Thus, ultimately, imperatives affect truth values. In this paper, we put forward an idea that allows us to reason with imperatives using classical logic by constructing a one-to-one correspondence between imperatives and a particular class (...) of declaratives. (shrink)

Two quite simple identities for exclusive disjunction and the biconditional are proven by mathematical induction. This proof is independently reprised in R.E. Jennings' /The Genealogy of Disjunction/ (OUP, 1994) pp. 6-7, esp. p. 7 which points out the consequences for the biconditional of the proof that runs from pages 6-7.

This piece lays the groundwork for the three 2006 pieces on "Abstracts from Logical Form" (two in /Journal of Pragmatics/, one in /RASK/). The brief introduction to classical logic, propositional and predicate, was inserted at the behest of the referees. Finally, Asimov's conjecture is solved--i.e., formalized--incorrectly here. A corrected version of this paper appeared in the 3rd Volume of /International Journal of Intelligent Systems/, with, as well, a somewhat different emphasis, and /sans/ the introduction to classical logic. However, although that (...) piece /does/ show that Asimov was correct, it does so on a textbook-type example of no intrinsic interest. For the correct solution (formalization) to Asimov's conjecture on Asimov's own story line see "The Logic of 'Double Talk': A Case Study in Diplomatic Deception" (/Journal of Literary Semantics/, 20(1): 53-55.). (shrink)

Natural deduction systems were motivated by the desire to define the meaning of each connective by specifying how it is introduced and eliminated from inference. In one sense, this attempt fails, for it is well known that propositional logic rules (however formulated) underdetermine the classical truth tables. Natural deduction rules are too weak to enforce the intended readings of the connectives; they allow non-standard models. Two reactions to this phenomenon appear in the literature. One is to try to restore the (...) standard readings, for example by adopting sequent rules with multiple conclusions. Another is to explore what readings the natural deduction rules do enforce. When the notion of a model of a rule is generalized, it is found that natural deduction rules express “intuitionistic” readings of their connectives. A third approach is presented here. The intuitionistic readings emerge when models of rules are defined globally, but the notion of a local model of a rule is also natural. Using this benchmark, natural deduction rules enforce exactly the classical readings of the connectives, while this is not true of axiomatic systems. This vindicates the historical motivation for natural deduction rules. One odd consequence of using the local model benchmark is that some systems of propositional logic are not complete for the semantics that their rules express. Parallels are drawn with incompleteness results in modal logic to help make sense of this. (shrink)

Claims that necessary and sufficient conditions are not converse relations are discussed, as well as the related claim that If A, then B is not equivalent to A only if B . The analysis of alleged counterexamples has shown, among other things, how necessary and sufficient conditions should be understood, especially in the case of causal conditions, and the importance of distinguishing sufficient-cause conditionals from necessary-cause conditionals. It is concluded that necessary and sufficient conditions, adequately interpreted, are converse relations in (...) all cases. (shrink)

The approach used by Boole in Mathematical analysis of logic to develop propositional logic was based on the idea of ?cases? or ?conjunctures of circumstances?. But this was dropped in Laws of thought in favor of one which Boole considered to be more satisfactory, that of using the notion of ?time for which a proposition is true?. We show that, when suitable clarifications and corrections are made, the earlier approach? which accords with modern logic in eschewing the extraneous notion of (...) time?is indeed a viable one. (shrink)

We show how the problem of strengthening the antecedent which is both formally valid and yet often intuitively invalid, concessive conditionals, and conditional rhetorical questions fit into the scheme put forth in Fulda (2010, /Acta Analytica/).

Three chapters contain the results independent of each other. In the first chapter I present a set of axioms for the propositional calculus which are shorter than the ones known so far, in the second one I give a method of defining all ternary connectives, in the third one, I prove that the probability of propositional functions is preserved under reversible substitutions.

This is a comprehensive study of the English word 'or', and the logical operators variously proposed to present its meaning. Although there are indisputably disjunctive uses of or in English, it is a mistake to suppose that logical disjunction represents its core meaning. 'Or' is descended from the Anglo-Saxon word meaning second, a form which survives in such expressions as "every other day." Its disjunctive uses arise through metalinguistic applications of an intermediate adverbial meaning which is conjunctive rather than disjunctive (...) in character. These conjunctive uses have puzzled philosophers and logicians, and have been discussed extensively under such headings as "free choice permission." This study examines the textbook myths that have clouded our understanding of how or and other "logical" vocabulary comes to have something approaching its logical meaning in natural languages. It considers the various historical conceptions of disjunction and its place in logic from the Stoics to the present day. (shrink)

Propositional logic, also known as sentential logic and statement logic, is the branch of logic that studies ways of joining and/or modifying entire propositions, statements or sentences to form more complicated propositions, statements or sentences, as well as the logical relationships and properties that are derived from these methods of combining or altering statements. In propositional logic, the simplest statements are considered as indivisible units, and hence, propositional logic does not study those logical properties and relations that depend upon parts (...) of statements that are not themselves statements on their own, such as the subject and predicate of a statement. The most thoroughly researched branch of propositional logic is classical truth-functional propositional logic, which studies logical operators and connectives that are used to produce complex statements whose truth-value depends entirely on the truth-values of the simpler statements making them up, and in which it is assumed that every statement is either true or false and not both. However, there are other forms of propositional logic in which other truth-values are considered, or in which there is consideration of connectives that are used to produce statements whose truth-values depend not simply on the truth-values of the parts, but additional things such as their necessity, possibility or relatedness to one another. (shrink)

We consider the problem about the length of proofs of the sentences $\operatorname{Con}_S(\underline{n})$ saying that there is no proof of contradiction in S whose length is ≤ n. We show the relation of this problem to some problems about propositional proof systems.

The concept of relevance between classical propositional formulae, defined in terms of letter-sharing, has been around for a very long time. But it began to take on a fresh life in 1999 when it was reconsidered in the context of the logic of belief change. Two new ideas appeared in independent work of Odinaldo Rodrigues and Rohit Parikh. First, the relation of relevance was considered modulo the belief set under consideration, Second, the belief set was put in a canonical form, (...) known as its finest splitting. In this paper we explain these ideas; relate the approaches of Rodrigues and Parikh to each other; and briefly report some recent results of Kourousias and Makinson on the extent to which AGM belief change operations respect relevance. Finally we suggest a further refinement of the notion of relevance by introducing a parameter that allows one to take epistemic as well as purely logical components into account. (shrink)

In much the same way that it is possible to construct a model of hyperbolic geometry in the Euclidean plane, it is possible to model quantum logic within the classical propositional calculus.

This text is a short introduction to logic that was primarily used for accompanying an introductory course in Logic for Linguists held at the New University of Lisbon (UNL) in fall 2010. The main idea of this course was to give students the formal background and skills in order to later assess literature in logic, semantics, and related fields and perhaps even use logic on their own for the purpose of doing truth-conditional semantics. This course in logic does not replace (...) a proper introduction to semantics and is not intended as such, although parts of Chapter 1 and 4 could be used to supplement an introductory course in semantics. In contrast to other introductions it has a certain focus on ‘writing things down correctly.’ Proofs of metatheorems are omitted, though. -/- This is work in progress. Please send suggestions and corrigenda to erich@snafu.de. Have fun! (shrink)

This paper develops a new framework for combining propositional logics, called "juxtaposition". Several general metalogical theorems are proved concerning the combination of logics by juxtaposition. In particular, it is shown that under reasonable conditions, juxtaposition preserves strong soundness. Under reasonable conditions, the juxtaposition of two consequence relations is a conservative extension of each of them. A general strong completeness result is proved. The paper then examines the philosophically important case of the combination of classical and intuitionist logics. Particular attention is (...) paid to the phenomenon of collapse. It is shown that there are logics with two stocks of classical or intuitionist connectives that do not collapse. Finally, the paper briefy investigates the question of which rules, when added to these logics, lead to collapse. (shrink)

Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.

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.

On the difficulty of extracting the logical form of a seemingly simple sentence such as ‘If Andy went to the movie then Beth went too, but only if she found a taxi cab’, with some morals and questions on the nature of the difficulty.

In this paper Grice’s requirements for assertability are imposed on the disjunction of Classical Logic. Defining material implication in terms of negation and disjunction supplemented by assertability conditions, results in the disappearance of the most important paradoxes of material implication. The resulting consequence relation displays a very strong resemblance to Schurz’s conclusion-relevant consequence relation.