This entry traces the historical development of the Square of Opposition, a collection of logical relationships traditionally embodied in a square diagram. This body of doctrine provided a foundation for work in logic for over two millenia. For most of this history, logicians assumed that negative particular propositions ("Some S is not P") are vacuously true if their subjects are empty. This validates the logical laws embodied in the diagram, and preserves the doctrine against modern criticisms. Certain additional principles ("contraposition" (...) and "obversion") were sometimes adopted along with the Square, and they genuinely yielded inconsistency. By the nineteenth century an inconsistent set of doctrines was widely adopted. Strawson's 1952 attempt to rehabilitate the Square does not apply to the traditional doctrine; it does salvage the nineteenth century version but at the cost of yielding inferences that lead from truth to falsity when strung together. (shrink)

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)

We propose a reconstruction of the constellation of problems and philosophical positions on the nature and number of the primitives of logic in four authors of the nineteenth century logical scene: Peano, Padoa, Frege and Peirce. We argue that the proposed reconstruction forces us to recognize that it is in at least four different senses that a notation can be said to be simpler than another, and we trace the origins of these four senses in the writings of these authors. (...) We conclude that Frege, and even more so Peirce, developed new notations not to make drawing logical conclusions easier but in order to answer the needs of logical analysis. (shrink)

Prolegomena It is fitting to begin this book on intuitionistic type theory by putting the subject matter into perspective. The purpose of this chapter is to ...

The calculus of relations was created and developed in the second half of the nineteenth century by Augustus De Morgan, Charles Sanders Peirce, and Ernst Schröder. In 1940 Alfred Tarski proposed an axiomatization for a large part of the calculus of relations. In the next decade Tarski's axiomatization led to the creation of the theory of relation algebras, and was shown to be incomplete by Roger Lyndon's discovery of nonrepresentable relation algebras. This paper introduces the calculus of relations and the (...) theory of relation algebras through a review of these historical developments. (shrink)

In this paper I argue that it is finally time to move beyond the Nagelian framework and to break new ground in thinking about epistemic reduction in biology. I will do so, not by simply repeating all the old objections that have been raised against Ernest Nagel’s classical model of theory reduction. Rather, I grant that a proponent of Nagel’s approach can handle several of these problems but that, nevertheless, Nagel’s general way of thinking about epistemic reduction in terms of (...) theories and their logical relations is entirely inadequate with respect to what is going on in actual biological research practice. (shrink)

Three different ways in which systems of axioms can contribute to the discovery of new notions are presented and they are illustrated by the various ways in which lattices have been introduced in mathematics by Schröder et al. These historical episodes reveal that the axiomatic method is not only a way of systematizing our knowledge, but that it can also be used as a fruitful tool for discovering and introducing new mathematical notions. Looked at it from this perspective, the creative (...) aspect of axiomatics for mathematical practice is brought to the fore. (shrink)

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)

The current assumptions of knowledge acquisition brought about the crisis in the reproducibility of experiments. A complementary perspective should account for the specific causality characteristic of life by integrating past, present, and future. A “second Cartesian revolution,” informed by and in awareness of anticipatory processes, should result in scientific methods that transcend the theology of determinism and reductionism. In our days, science, itself an expression of anticipatory activity, makes possible alternative understandings of reality and its dynamics. For this purpose, the (...) study advances G-complexity for defining and comparing decidable and undecidable knowledge. AI and related computational expressions of knowledge could benefit from the awareness of what distinguishes the dynamics of life from any other expressions of change. (shrink)

According to the standard view of particularity, an entity is a particular just in case it necessarily has a unique spatial location at any time of its existence. That the basic entities of the world we speak about in common sense and science are particular entities in this sense is the thesis of “foundational particularism,” a theoretical intuition that has guided Western ontological research from its beginnings to the present day. The main aim of this paper is to review the (...) notion of particularity and its role in ontology. I proceed in four steps. First, I offer a brief reconstruction of the tasks of ontology as “theory of categorial inference in L”. An ontological theory states which (combinations of) entity types or categories make true L-sentences true; the features of the stipulated categories explain why L-speakers are entitled to draw certain material inferences from the classificatory expressions of L. Second, I draw attention to the fact that since Aristotle this theoretical program typically has been implemented with peculiar restrictions prescribing certain combinations of category features, e.g., the combination of particularity, concreteness, individuality, and subjecthood. I briefly sketch how these restrictions of the “substance paradigm” or “myth of substance” are reinforced by the standard readings of predicate-logical constants, viz. the existential quantifier and the identity sign. Third, I argue that in the context of the substance paradigm foundational particularism is incoherent. I discuss the current standard conceptions of particulars as developed in the debate about individuation (bare particulars, nude particulars, tropes) and show that their main difficulties derive from the traditional restriction that particulars are so also logical subjects and/or individuals. Fourth, to show that the traditional linkages of category features are not conceptual necessities, I sketch the outlines of an ontology (General Process Theory) based on non-particular individuals. For ontologists in computer science working with description logic this monocategoreal ontology based on more or less generic ‘dynamics’ may hold special interest. As General Process Theory documents, ontologists may well abandon the notion of particularity: in common sense and science we do reason about items that have a unique spatial location at any time, but the uniqueness of their location can be taken to be a contingent affair. (shrink)

The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. The application of this undervalued formalism has been hampered by the absence of well-behaved proof systems on the one hand, and accessible presentations of its theory on the other. One significant early result for the original axiomatic proof system for the epsilon-calculus is the first epsilon theorem, for which a proof is sketched. The system itself is discussed, also relative to possible semantic interpretations. The problems facing (...) the development of proof-theoretically well-behaved systems are outlined. (shrink)

With this paper I aim to demonstrate that a look beyond the Aristotelian square of opposition, and a related non-conservative view on logical determiners, contributes to both the understanding of Aristotelian syllogistics as well as to the study of quantificational structures in natural language.

Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved in polynomial time as well. A (...) solution for the so-called NP-complete problems will also be a solution for any other such problems. Its artificial-intelligence analogue is the class of AI-complete problems, for which a complete mathematical formalization still does not exist. In this chapter we will focus on analysing computational classes to better understand possible formalizations of AI-complete problems, and to see whether a universal algorithm, such as a Turing test, could exist for all AI-complete problems. In order to better observe how modern computer science tries to deal with computational complexity issues, we present several different deep-learning strategies involving optimization methods to see that the inability to exactly solve a problem from a higher order computational class does not mean there is not a satisfactory solution using state-of-the-art machine-learning techniques. Such methods are compared to philosophical issues and psychological research regarding human abilities of solving analogous NP-complete problems, to fortify the claim that we do not need to have an exact and correct way of solving AI-complete problems to nevertheless possibly achieve the notion of strong AI. (shrink)

My purpose here is purely historical. It is not an attempt to resolve the question as to whether Russell did or did not countenance nonclassical logics, and if so, which nonclassical logics, and still less to demonstrate whether he himself contributed, in any manner, to the development of nonclassical logic. Rather, I want merely to explore and insofar as possible document, whether, and to what extent, if any, Russell interacted with the various, either the various candidates or their, ideas that (...) Dejnožka and others have proposed as potentially influential in Russell’s intellectual reactions to nonclassical logic or to the philosophical concepts that might contribute to his reactions to nonclassical logics. (shrink)

Expressively equivalent logical languages can enunciate logical notions in notationally diversified ways. Frege’s Begriffsschrift, Peirce’s Existential Graphs, and the notations presented by Wittgenstein in the Tractatus all express the sentential fragment of classical logic, each in its own way. In what sense do expressively equivalent notations differ? According to recent interpretations, Begriffsschrift and Existential Graphs differ from other logical notations because they are capable of “multiple readings.” We refute this interpretation by showing that there are at least three different kinds (...) of such multiple readings. While readings of the first kind do not capture any essential difference among notations but only among vocabularies, corresponding to readings of the second and the third kind two general parameters according to which notations may differ are defined: linearity vs. non-linearity, and tabularity vs. non-tabularity. This answers the question of how there can be substantially different but expressively equivalent logical notations. (shrink)

This paper proposes a formalization of the class of sentences quantified by most, which is also interpreted as proportion of or majority of depending on the domain of discourse. We consider sentences of the form “Most A are B”, where A and B are plural nouns and the interpretations of A and B are infinite subsets of \. There are two widely used semantics for Most A are B: \ > C \) and \ > \dfrac{C}{2} \), where C denotes (...) the cardinality of a given finite set X. Although is more descriptive than, it also produces a considerable amount of insensitivity for certain sets. Since the quantifier most has a solid cardinal behaviour under the interpretation majority and has a slightly more statistical behaviour under the interpretation proportional of, we consider an alternative approach in deciding quantity-related statements regarding infinite sets. For this we introduce a new semantics using natural density for sentences in which interpretations of their nouns are infinite subsets of \, along with a list of the axiomatization of the concept of natural density. In other words, we take the standard definition of the semantics of most but define it as applying to finite approximations of infinite sets computed to the limit. (shrink)

Peirce wrote in late 1901 a text on formal logic using a special Dragon-Head and Dragon-Tail notation in order to express the relation of logical consequence and its properties. These texts have not been referred to in the literature before. We provide a complete reconstruction and transcription of these previously unpublished sets of manuscript sheets and analyse their main content. In the reconstructed text, Peirce is seen to outline both a general theory of deduction and a general theory of consequence (...) relation. The two are the cornerstones of modern logic and have played a crucial role in its development. From the wider perspective, Peirce is led to these theories by three important generalizations: propositions to all signs, truth to scriptibility, and derivation to transformability. We provide an exposition of such proposed semiotic foundation for logical constants and point out a couple of further innovations in this rare text, including the sheet of assertion, correction as a dual of deduction and the nature of conditionals as variably strict conditionals. (shrink)

Sound and complete semantics for classical propositional logic can be obtained by interpreting sentences as sets. Replacing sets with commuting dense binary relations produces an interpretation that turns out to be sound but not complete for R. Adding transitivity yields sound and complete semantics for RM, because all normal Sugihara matrices are representable as algebras of binary relations.

Peirce aspired for the completeness of his logic cum the theory of signs in his 1903 Lowell Lectures and other late manuscripts. Semeiotic completeness states that everything that is a consequence in logical critic is derivable in speculative grammar. The present paper exposes the reasons why Peirce would fall short of establishing semeiotic completeness and thus why he would not continue seeking a perfect match between the theories of grammar and critic. Some alternative notions are then proposed.

This volume examines the entire logical and philosophical production of Nikolai A. Vasil’ev, studying his life and activities as a historian and man of letters. Readers will gain a comprehensive understanding of this influential Russian logician, philosopher, psychologist, and poet. The author frames Vasil’ev’s work within its historical and cultural context. He takes into consideration both the situation of logic in Russia and the state of logic in Western Europe, from the end of the 19th century to the beginning of (...) the 20th. Following this, the book considers the attempts to develop non-Aristotelian logics or ideas that present affinities with imaginary logic. It then looks at the contribution of traditional logic in elaborating non-classical ideas. This logic allows the author to deal with incomplete objects just as imaginary logic does with contradictory ones. Both logics are objects of interesting analysis by modern researchers. (shrink)

Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...) is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction. We conclude that our mathematical frame work is inappropriate for Theory of Computation. Furthermore, the result provides us a reason that many problems in Complexity Theory resist to be solved.(This work is completed in 2017 -5- 2, it is in vixra in 2017-5-14, presented in Unilog 2018, Vichy). (shrink)

This article examines the traditional and modern doctrines of categorical propositions and argues that both doctrines have serious problems. While the doctrines disagree about existential imports...

It is of common use in modern Venn diagrams to mark a compartment with a cross to express its non-emptiness. Modern scholars seem to derive this convention from Charles S. Peirce, with the assumption that it was unknown to John Venn. This paper demonstrates that Venn actually introduced several methods to represent existentials but felt uneasy with them. The resistance to formalize existentials was not limited to diagrammatic systems, as George Boole and his followers also failed to provide a satisfactory (...) symbolic representation for them. This difficulty points out issues that are inherent to the very nature of existentials. This paper assesses the various methods designed for the representation of existential statements with Venn diagrams. First, Venn’s own attempts are discussed and compared with other solutions proposed by his contemporaries and successors, notably Lewis Carroll and Peirce. Since disjunctives hold an important role in an effective representation of existentials, their representation is also discussed. Finally, recent methods for the diagrammatic representation of existing individuals, rather than mere existence, are surveyed. (shrink)

The aim of this paper is to provide a contribution to the natural logic program which explores logics in natural language. The paper offers two logics called \ \) and \ \) for dealing with inference involving simple sentences with transitive verbs and ditransitive verbs and quantified noun phrases in subject and object position. With this purpose, the relational logics are introduced and a model-theoretic proof of decidability for they are presented. In the present paper we develop algebraic semantics of (...) the logics using congruence theory. (shrink)

Ernst Schröder, Parafrasi Schröderiane. Ovvero: Ernst Schröder, Leoperazioni del Calcolo Logico. Original German text with Italian translation, commentary and annotations by Davide Bondoni, LED Edizioni, Milan, 2010, pp. 208, 15,5 × 22 cm, ISBN 978-88-7916-474-0.

The deductive system in Boole's Laws of Thought (LT) involves both an algebra, which we call proto-Boolean, and a "general method in Logic" making use of that algebra. Our object is to elucidate these two components of Boole's system, to prove his principal results, and to draw some conclusions not explicit in LT. We also discuss some examples of incoherence in LT; these mask the genius of Boole's design and account for much of the puzzled and disparaging commentary LT has (...) received. Our evaluation of Boole's logical system does not differ substantially from that advanced in Hailperin's exhaustive study, Boole's Logic and Probability. Unlike the latter work, however, we make direct use of the polynomials native to LT rather than appealing to formalisms such as multisets and rings. (shrink)

This thesis is on the history and philosophy of logic and semantics. Logic can be described as the ‘science of reasoning’, as it deals primarily with correct patterns of reasoning. However, logic as a discipline has undergone dramatic changes in the last two centuries: while for ancient and medieval philosophers it belonged essentially to the realm of language studies, it has currently become a sub-branch of mathematics. This thesis attempts to establish a dialogue between the modern and the medieval traditions (...) in logic, by means of ‘translations’ of the medieval logical theories into the modern framework of symbolic logic, i.e. formalizations. One of its conclusions is that, when properly understood within their own framework, the interest of medieval logical theories for modern investigations go beyond mere historical interest, but that a thorough conceptual analysis of such theories must be undertaken in order to avoid conceptual misprojections. While such translations of medieval into modern logic have been attempted before, the approach presented here is innovative in that attention is paid to the similarities as well as to the dissimilarities between the two traditions, and to what can be learned from the medieval masters for modern investigations in logic and semantics. (shrink)

The “sign of consequence” is a notation for propositional logic that Peirce invented in 1886 and used at least until 1894. It substituted the “copula of inclusion” which he had been using since 1870.

Causation is of undeniable importance to our understanding of, and interaction with our surroundings. Despite this, the correct understanding of causation remains subject to considerable philosophical controversy. In this article, I introduce the most influential philosophical theories of causation, and provide an overview of the main difficulties that has led to the currently most popular versions of these theories.

In 1909, Peirce recorded in a few pages of his logic notebook some experiments with matrices for three-valued propositional logic. These notes are today recognized as one of the first attempts to create non-classical formal systems. However, besides the articles published by Turquette in the 1970s and 1980s, very little progress has been made toward a comprehensive understanding of the formal aspects of Peirce's triadic logic (as he called it). This paper aims to propose a new approach to Peirce's matrices (...) for three-valued propositional logic. We suggested that his logical matrices give rise to three different systems, one of them - which we called P3 - is an original and non-explosive logic. Besides that, we will show that the P3 system can easily be transformed into paraconsistent and paracomplete calculi, adding to it, respectively, unary operators of consistency and intuitionistic negation. We conclude with a discussion about philosophical motivations. (shrink)

If argument forms evolve then the possible existence of localized argument forms may create an interpretive impasse between locally distinct argument communities. Appeal to evolutionarily ‘deep’ argument forms may help, but might be strained in cases where emergent argument forms are not reducible to their base conditions. Overcoming such limits presupposes the virtue of compromise, suggesting that compromise may stand as ‘deep virtue’ within argumentative forms of life.

Since the pioneering work by Kripke and Montague, the term possible world has appeared in most theories of formal semantics for modal logics, natural languages, and knowledge-based systems. Yet that term obscures many questions about the relationships between the real world, various models of the world, and descriptions of those models in either formal languages or natural languages. Each step in that progression is an abstraction from the overwhelming complexity of the world. At the end, nothing is left but a (...) colorful metaphor for an undefined element of a set W called worlds, which are related by an undefined and undefinable primitive relation R called accessibility. For some purposes, the resulting abstraction has proved to be useful, but as a general theory of meaning, the abstraction omits too many significant features. So much information has been lost at each step that many philosophers, linguists, and psychologists have dismissed model-theoretic semantics as irrelevant to the study of meaning. This article examines the steps in the process of extractingthe pair (W,R) from the world and the way people talk about the world. It shows that the Kripke worlds can be reinterpreted as part of a Peircean semiotic theory, which can also include contributions from many other studies in cognitive science. Among them are Dunn’s semantics based on laws and facts, the lexical semantics preferred by manylinguists, psychological models of how the world is perceived, and philosophies of science that relate theories to the world. A full integration of all those sources is far beyond the scope of this article, but an outline of the approach suggests that Peirce’s vision is capable of relating and reconciling the competing sources. (shrink)

Van Heijenoort’s account of the historical development of modern logic was composed in 1974 and first published in 1992 with an introduction by his former student. What follows is a new edition with a revised and expanded introduction and additional notes.

Contemporary logicians continue to address problems associated with the existential import of categorical propositions. One notable problem concerns invalid instances of subalternation in the case of a universal proposition with an empty subject term. To remedy problems, logicians restrict first-order predicate logics to exclude such terms. Examining the historical origins of contemporary discussions reveals that logicians continue to make various category mistakes. We now believe that no proposition per se has existential import as commonly understood and thus it is unnecessary (...) to restrict first-order predicate logics to non-empty classes. After introducing the problem, we trace some nineteenth century treatments of the issue to locate a source of misconstruing propositional import in misconceptions of ‘implies’ and ‘affirms’ and name the process/product fallacy, along with the translation of categorical sentences using quantifiers and accommodating an empty class. Next we treat some metalogical matters to orient our discussion by which we provide a more precise nomenclature about ‘sentence’ and ‘proposition’ to correct previous misconceptions; here we uncover a common category mistake in respect of a proposition’s efficacy. The semantic distinction between agent and force is helpful in this connection. We conclude by showing that logicians have reinserted existence as a predicate, a position previously excised by Kant, and that the Frege-Russell ambiguity thesis applies only to relationships within a categorical sentence between grammatical predicate and subject. (shrink)

The aim of this article is Schröder’s treatment of the so called solution problem [Auflösungsproblem]. First, I will introduce Schröder’s ideas; then I will discuss them taking into account Peirce’s considerations in The Logic of Relatives ([13, pp. 161–217] now republished in [9, pp. 288–345]).

Hypersequents are a natural generalization of ordinary sequents which turn out to be a very suitable tool for presenting cut-free Gentzent-type formulations for diverse logics. In this paper, an alternative way of formulating hypersequent calculi (by introducing meta-variables for formulas, sequents and hypersequents in the object language) is presented. A suitable category of hypersequent calculi with their morphisms is defined and both types of fibring (constrained and unconstrained) are introduced. The introduced morphisms induce a novel notion of translation between logics (...) which preserves metaproperties in a strong sense. Finally, some preservation features are explored. (shrink)

De Morgan's Formal Logic, which was published on virtually the same day in 1847 as Boole's The Mathematical Analysis of Logic, contains a logic of complex terms (LCT) which has been sadly neglected. It is surprising to find that LCT contains almost a full theory of Boolean algebra. This paper will: (1) provide some background to LCT; (2) outline its main features; (3) point out some gaps in it; (4) compare it with Boole's algebra; (5) show that it is a (...) lattice-theoretical formulation of Boolean algebra; (6) discuss some issues of historical priority; and (7) conclude with the puzzle of LCT's lack of influence. (shrink)