This article investigates Charles Peirce’s development of logical calculi for classical propositional logic in 1880–1896. Peirce’s 1880 work on the algebra of logic resulted in a successful calculus for Boolean algebra. This calculus, denoted byPC, is here presented as a sequent calculus and not as a natural deduction system. It is shown that Peirce’s aim was to presentPCas a sequent calculus. The law of distributivity, which Peirce states in 1880, is proved using Peirce’s Rule, which is a residuation, inPC. The (...) transitional systems of the algebra of the copula that Peirce develops since 1880 paved the way to the 1896 graphical system of the alpha graphs. It is shown how the rules of the alpha system reinterpret Boolean algebras, answering Peirce’s statement that logical graphs supply a new system of fundamental assumptions to logical algebra. A proof-theoretic analysis is given for the connection betweenPCand the alpha system. (shrink)

In early modernity, one can find many spatial logic diagrams whose geometric forms share a family resemblance with religious art and symbols. The family resemblance these diagrams bear in form is often based on a vesica piscis or on a cross: Both logic diagrams and spiritual symbols focus on the intersection or conjunction of two or more entities, e.g. subject and predicate, on the one hand, or god and man, on the other. This paper deals with the development and function (...) of logic diagrams, their analogy to religious art and symbols, and their modern application in artificial intelligence. (shrink)

We seek means of distinguishing logical knowledge from other kinds of knowledge, especially mathematics. The attempt is restricted to classical two-valued logic and assumes that the basic notion in logic is the proposition. First, we explain the distinction between the parts and the moments of a whole, and theories of ?sortal terms?, two theories that will feature prominently. Second, we propose that logic comprises four ?momental sectors?: the propositional and the functional calculi, the calculus of asserted propositions, and rules for (...) (in)valid deduction, inference or substitution. Third, we elaborate on two neglected features of logic: the various modes of negating some part(s) of a proposition R, not only its ?external? negation not-R; and the assertion of R in the pair of propositions ?it is (un)true that R? belonging to the neglected logic of asserted propositions, which is usually left unstated. We also address the overlooked task of testing the asserted truth-value of R. Fourth, we locate logic among other foundational studies: set theory and other theories of collections, metamathematics, axiomatisation, definitions, model theory, and abstract and operator algebras. Fifth, we test this characterisation in two important contexts: the formulation of some logical paradoxes, especially the propositional ones; and indirect proof-methods, especially that by contradiction. The outcomes differ for asserted propositions from those for unasserted ones. Finally, we reflect upon self-referring self-reference, and on the relationships between logical and mathematical knowledge. A subject index is appended. (shrink)

Truth diagrams are introduced as a novel graphical representation for propositional logic. To demonstrate their epistemic efficacy a set of 28 concepts are proposed that any comprehensive representation for PL should encompass. TDs address all the criteria whereas seven other existing representations for PL only provide partial coverage. These existing representations are: the linear formula notation, truth tables, a PL specific interpretation of Venn Diagrams, Frege’s conceptual notation, diagrams from Wittgenstein’s Tractatus, Pierce’s alpha graphs and Gardner’s shuttle diagrams. The comparison (...) of the representations succeeds in distinguishing ideas that are fundamental to PL from features of common PL representations that are somewhat arbitrary. (shrink)

Since Peirce defined the first operators for three-valued logic, it is usually assumed that he rejected the principle of bivalence. However, I argue that, because bivalence is a principle, the strategy used by Peirce to defend logical principles can be used to defend bivalence. Construing logic as the study of substitutions of equivalent representations, Peirce showed that some patterns of substitution get realized in the very act of questioning them. While I recognize that we can devise non-classical notations, I argue (...) that, when we make claims about those notations, we inevitably get saddled with bivalent commitments. I present several simple inferences to show this. The argument that results from those examples is ‘pragmatic’, because the inevitability of the principle is revealed in use (not mention); and it is ‘semiotic’, because this revelation happens in the use of signs. (shrink)

One of the reasons colours, or better the conceptual organisation of the colour system, could be relevant to the philosophy of logic is that they necessitate some mutilation of truth tables by restricting truth functionality. This paper argues that the so-called ‘Colour Exclusion Problem’, the first great challenge for Wittgenstein’s Tractatus, is a legitimate philosophical motivation for a systematic mutilation of truth tables. It shows how one can express, through these mutilations, some intensional logical relations usually expressed by the Aristotelian (...) Square of Oppositions, as contrariety and subcontrariety. (shrink)