This paper reconstructs Venn’s algebraic logic and identifies some of the philosophical notions concerning the nature of symbolic knowledge underlying his work. We show that Venn, in facing philosophical problems associated with his algebraic logic, needs to articulate the symbolic knowledge notions of ecthetic function and of surrogative function. The paper explains those notions based on the systematization of the functions of symbolic knowledge that we find in the recent philosophical literature. This paper also situates Venn’s work within the 19th (...) Century efforts towards a symbolization of logic, and, through an analysis of a historical case, clarifies the notions of ecthetic function and of surrogative function. (shrink)

A generation before Beardsley, legal scholar John Henry Wigmore invented a scheme for representing arguments in a tree diagram, aimed to help advocates analyze the proof of facts at trial. In this essay, I describe Wigmore's "Chart Method" and trace its origin and influence. Wigmore, I argue, contributes to contemporary theory in two ways. His rhetorical approach to diagramming provides a novel perspective on problems about the theory of reasoning, premise adequacy, and dialectical obligations. Further, he advances a novel solution (...) to the problem of assessing argument quality by representing the strength of argument in meeting objections. (shrink)

We present a set-theoretic model of the mental representation of classically quantified sentences (All P are Q, Some P are Q, Some P are not Q, and No P are Q). We take inclusion, exclusion, and their negations to be primitive concepts. It is shown that, although these sentences are known to have a diagrammatic expression (in the form of the Gergonne circles) which constitute a semantic representation, these concepts can also be expressed syntactically in the form of algebraic formulas. (...) It is hypothesized that the quantified sentences have an abstract underlying representation common to the formulas and their associated sets of diagrams (models). Nine predictions are derived (three semantic, two pragmatic, and four mixed) regarding people's assessment of how well each of the five diagrams expresses the meaning of each of the quantified sentences. The results from three experiments, using Gergonne's circles or an adaptation of Leibniz lines as external representations, are reported and shown to support the predictions. (shrink)

This paper addresses questions of universality related to ontological engineering, namely aims at substantiating (negative) answers to the following three basic questions: (i) Is there a ‘universal ontology’?, (ii) Is there a ‘universal formal ontology language’?, and (iii) Is there a universally applicable ‘mode of reasoning’ for formal ontologies? To support our answers in a principled way, we present a general framework for the design of formal ontologies resting on two main principles: firstly, we endorse Rudolf Carnap’s principle of logical (...) tolerance by giving central stage to the concept of logical heterogeneity, i.e. the use of a plurality of logical languages within one ontology design. Secondly, to structure and combine heterogeneous ontologies in a semantically well-founded way, we base our work on abstract model theory in the form of institutional semantics, as forcefully put forward by Joseph Goguen and Rod Burstall. In particular, we employ the structuring mechanisms of the heterogeneous algebraic specification language HetCasl for defining a general concept of heterogeneous, distributed, highly modular and structured ontologies, called hyperontologies. Moreover, we distinguish, on a structural and semantic level, several different kinds of combining and aligning heterogeneous ontologies, namely integration, connection, and refinement. We show how the notion of heterogeneous refinement can be used to provide both a general notion of sub-ontology as well as a notion of heterogeneous equivalence of ontologies, and finally sketch how different modes of reasoning over ontologies are related to these different structuring aspects. (shrink)

The problem of enumerating the types of Boolean functions under the group of variable permutations and complementations was first stated by Jevons in the 1870s. but not solved in a satisfactory way until the work of Pólya in 1940. This paper explains the details of Pólya's solution, and also the history of the problem from the 1870s to the 1970s.

Although the existence of correspondence between George Boole (1815?1864) and William Stanley Jevons (1835?1882) has been known for a long time and part was even published in 1913, it has never been fully noted; in particular, it is not in the recent edition of Jevons's letters and papers. The texts are transcribed here, with indication of their significance. Jevons proposed certain quite radical changes to Boole's system, which Boole did not accept; nevertheless, they were to become well established.

The work of Hugh MacColl (1837–1909) suffered the same fate after his death as before it:despite being vaguely alluded to and in part even commended, on the whole it has remained an unknown quantity. Even worse, those of his ideas which have played a decisive role in the history of logic have been credited to his successors; this is especially the case with the definition of strict implication and the first formal development of formal modal logic. This paper takes an (...) initial step towards a rectification of this unfortunate misrepresentation, presenting a bibliography of MacColl’s most significant publications with particular regard to their reception. (shrink)

We discuss external and internal graphical and linguistic representational systems. We argue that a cognitive theory of peoples' reasoning performance must account for (a) the logical equivalence of inferences expressed in graphical and linguistic form; and (b) the implementational differences that affect facility of inference. Our theory proposes that graphical representations limit abstraction and thereby aid processibility. We discuss the ideas of specificity and abstraction, and their cognitive relevance. Empirical support comes from tasks (i) involving and (ii) not involving the (...) manipulation of external graphics. For (i), we take Euler's Circles, provide a novel computational reconstruction, show how it captures abstractions, and contrast it with earlier construals, and with Mental Models' representations. We demonstrate equivalence of the graphical Euler system, and the non-graphical Mental Models system. For (ii), we discuss text comprehension, and the mental performance of syllogisms. By positing an internal system with the same specificity as Euler's Circles we cover the Mental Models data, and generate new empirical predictions. Finally, we consider how the architecture of working memory explains why such specific representations are relatively easy to store. (shrink)

Logic diagrams have been increasingly studied and applied for a few decades, not only in logic, but also in many other fields of science. The history of logic diagrams is an important subject, as many current systems and applications of logic diagrams are based on historical predecessors. While traditional histories of logic diagrams cite pioneers such as Leibniz, Euler, Venn, and Peirce, it is not widely known that Kant and the early Kantians in Germany and England played a crucial role (...) in popularising Euler(-type) diagrams. In this paper, the role of the Kantians in the late eighteenth and early nineteenth centuries will be analysed in more detail. It shows that diagrams (or intuition in general) were a highly contentious topic that depend on the philosophical attitude and went beyond logic to touch on issues of physics, metaphysics, linguistics and, above all, mathematics. (shrink)

George Boole published the pamphlet The Mathematical Analysis of Logic in 1847. He believed that logic should belong to a universal mathematics that would cover both quantitative and nonquantitative research. With his pamphlet, Boole signalled an important change in symbolic logic: in contrast with his predecessors, his thinking was exclusively extensional. Notwithstanding the innovations introduced he accepted all traditional Aristotelean syllogisms. Nevertheless, some criticisms have been raised concerning Boole’s view of Aristotelean logic as the solution of algebraic equations. In order (...) to circumvent such criticisms, we show here how Boole’s conclusions may be deduced from the axioms and inference rules proposed in his pamphlet, from which Aristotle’s deductions in Prior Analytics (including those that are completed through an impossibility) can be stated as theorems. We clarify his method for dealing with both universal and particular premises by means of his symbol v and demystify some criticisms concerning the way he expressed particular premises. Boole’s conclusions for some of those premises for which according to Aristotle there is no deduction are also discussed. The deductive system presented here has the potential to provide a new perspective on Boole’s approach to logic in The Mathematical Analysis of Logic. (shrink)

In this paper we argue that there were several currents, ideas and problems in 19th-century logic that motivated John Venn to develop his famous logic diagrams. To this end, we first examine the problem of uncertainty or over-specification in syllogistic that became obvious in Euler diagrams. In the 19th century, numerous logicians tried to solve this problem. The most famous was the attempt to introduce dashed circles into Euler diagrams. The solution that John Venn developed for this problem, however, came (...) from a completely different area of logic: instead of orienting to syllogistic like Euler diagrams, Venn applied Boolean algebra to improve visual reasoning. Venn’s contribution to solving the problem of elimination also played an important role. The result of this development is still known today as the ‘Venn Diagram’. (shrink)

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)

Moral obligation and permissibility are usually thought to be interdefinable. Following the pattern of the duality definitions of necessity and possibility, we have that something’s being permissible could be defined as its not being obligatory to not do it. And that something’s being obligatory could be defined as its not being permissible to not do it. In this paper, I argue that neither direction of this alleged interdefinability works. Roughly, the problem is that a claim that some act is obligatory (...) or permissible entails that there is a moral law, whereas a negative claim that some act is not obligatory or not permissible does not. Nevertheless, one direction of the interdefinability can potentially be salvaged. I argue that, if we do not require the conceptual possibility of moral dilemmas, then there is a way to plausibly define obligation in terms of permissibility. I conclude that permissibility is the only feasible deontic primitive. (shrink)

This paper presents, assesses, and compares six diagrammatic methods for Categorical Syllogistic. Venn’s Method is widely used in logic textbooks; Carroll’s Method is a topologically indistinguishable version of Venn’s Method; and the four remaining methods are my own: the Dual of Carroll’s Method, Gardner’s Method, Gardner–Peirce’s Method, and Ladd’s Method. These methods are divided into two groups of three and the reasons for switching from a method to another within each group are discussed. Finally, a comparison between the Dual of (...) Carroll’s Method and Ladd’s Method supports the main result of the paper, which is an approximation of the two groups of methods. (shrink)

A graph-theoretic account of logics is explored based on the general notion of m-graph (that is, a graph where each edge can have a finite sequence of nodes as source). Signatures, interpretation structures and deduction systems are seen as m-graphs. After defining a category freely generated by a m-graph, formulas and expressions in general can be seen as morphisms. Moreover, derivations involving rule instantiation are also morphisms. Soundness and completeness theorems are proved. As a consequence of the generality of the (...) approach our results apply to very different logics encompassing, among others, substructural logics as well as logics with nondeterministic semantics, and subsume all logics endowed with an algebraic semantics. (shrink)

According to Boole it is possible to deduce the principle of contradiction from what he calls the fundamental law of thought and expresses as \. We examine in which framework this makes sense and up to which point it depends on notation. This leads us to make various comments on the history and philosophy of modern logic.

The paper argues that the view that the particular quantifier is ‘existentially loaded’ is a relatively new one historically and that it has become entrenched in modern philosophical logic for less than happy reasons.

In the period 1893–1897 Charles Dodgson, writing as Lewis Carroll, published two books and two articles on logic topics. Manuscript material first published in 1977 together with letters and diary entries provide evidence that he was working toward a visual proof system for complex syllogistic propositional logic based on a mechanical tree method that he devised.

Hypotheticals, conditionals, and their connecting relation, implication, dramatically changed their meanings during the nineteenth and early part of the twentieth century. Modern logicians ordinarily do not distinguish between the terms hypothetical and conditional. Yet in the late nineteenth century their meanings were quite different, their ties to the implication relation either were unclear, or the implication relation was used exclusively as a logical operator. I will trace the development of implication as an inference operator from these earlier notions into the (...) first third of the twentieth century using as the starting point the ideas primarily of R. Whately and W. Hamilton before discussing the work of the transitional logicians, A. De Morgan and G. Boole on these topics. Then we discuss the relevant views of four prominent but relatively unknown nineteenth century British logicians, W.E. Johnson, J.N. Keynes, E.E.C. Jones, and H. MacColl, as well as those of the more influential logicians, W.S. Jevons and J. Venn, closing with a section on ‘implication as inference’ where we explore some key ideas of B. Russell and sketch the work of D. Hilbert, P. Hertz, and G. Gentzen who together are responsible for the development of the modern ideas related to the subjects of this paper. (shrink)

John Venn and Charles L. Dodgson (Lewis Carroll) created systems of logic diagrams capable of representing classes (sets) and their relations in the form of propositions. Each is a proof method for syllogisms, and Carroll's is a sound and complete system. For a large number of sets, Carroll diagrams are easier to draw because of their self-similarity and algorithmic construction. This regularity makes it easier to locate and thereby to erase cells corresponding with classes destroyed by the premises of an (...) argument, a particularly difficult task in Venn diagrams for more than four sets. Carroll diagrams can represent existential propositions easily, so they are capable of clearly representing more complex problems than Venn's system can. Finally, both Carroll and Venn diagrams are maximal, in the sense that no additional logic information like inclusive disjunctions is able to be represented by them. Carroll's logic diagrams and logic trees constitute his visual logic system. (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)

The history of modern logic is usually written as the history of mathematical or, more general, symbolic logic. As such it was created by mathematicians. Not regarding its anticipations in Scholastic logic and in the rationalistic era, its continuous development began with George Boole's The Mathematical Analysis of Logic of 1847, and it became a mathematical subdiscipline in the early 20th century. This style of presentation cuts off one eminent line of development, the philosophical development of logic, although logic is (...) evidently one of the basic disciplines of philosophy. One needs only to recall some of the standard 19th century definitions of logic as, e.g., the art and science of reasoning (Whateley) or as giving the normative rules of correct reasoning (Herbart). In the paper the relationship between the philosophical and the mathematical development of logic will be discussed. Answers to the following questions will be provided: 1. What were the reasons for the philosophers' lack of interest in formal logic? 2. What were the reasons for the mathematicians' interest in logic? 3. What did "logic reform" mean in the 19th century? Were the systems of mathematical logic initially regarded as contributions to a reform of logic? 4. Was mathematical logic regarded as art, as science or as both? (shrink)

In the Laws of Thought, Boole establishes a theory of secondary propositions based upon the notion of time. This temporal interpretation of secondary propositions has historically been met with wide disapproval and is usually dismissed in the modern literature as a philosophical non-starter. What was Boole thinking? This paper attempts to give an answer to this question. Specifically, it provides an account according to which Boole’s temporal interpretation follows from his psychologistic conception of logic, in addition to certain background assumptions (...) regarding the psychological necessity of the concept of time. Once Boole’s psychological premises are laid bare, it becomes clearer how he might have viewed the temporal interpretation to be an essential feature of his theory of secondary propositions. (shrink)

A new diagram system \ where properties are fundamental and an object exists only w.r.t a property is presented. This work modifies both in syntax and semantics the system \ proposed by Choudhury and Chakraborty to picturise and address issues connected with open universe. Semantics for the current system is given. Soundness and completeness w.r.t the semantics are established.

Venn diagram system has been extended by introducing names of individuals and their absence. Absence gives a kind of negation of singular propositions. We have offered here a non-classical interpretation of this negation. Soundness and completeness of the present diagram system have been established with respect to this interpretation.

This paper explores the question of what makes diagrammatic representations effective for human logical reasoning, focusing on how Euler diagrams support syllogistic reasoning. It is widely held that diagrammatic representations aid intuitive understanding of logical reasoning. In the psychological literature, however, it is still controversial whether and how Euler diagrams can aid untrained people to successfully conduct logical reasoning such as set-theoretic and syllogistic reasoning. To challenge the negative view, we build on the findings of modern diagrammatic logic and introduce (...) an Euler-style diagrammatic representation system that is designed to avoid problems inherent to a traditional version of Euler diagrams. It is hypothesized that Euler diagrams are effective not only in interpreting sentential premises but also in reasoning about semantic structures implicit in given sentences. To test the hypothesis, we compared Euler diagrams with other types of diagrams having different syntactic or semantic properties. Experiment compared the difference in performance between syllogistic reasoning with Euler diagrams and Venn diagrams. Additional analysis examined the case of a linear variant of Euler diagrams, in which set-relationships are represented by one-dimensional lines. The experimental results provide evidence supporting our hypothesis. It is argued that the efficacy of diagrams in supporting syllogistic reasoning crucially depends on the way they represent the relational information contained in categorical sentences. (shrink)

We discuss external and internal graphical and linguistic representational systems. We argue that a cognitive theory of peoples' reasoning performance must account for (a) the logical equivalence of inferences expressed in graphical and linguistic form, and (b) the implementational differences that affect facility of inference. Our theory proposes that graphical representation limit abstraction and thereby aid “processibility”. We discuss the ideas of specificity and abstraction, and their cognitive relevance. Empirical support both comes from tasks which involve the manipulation of external (...) graphics and tasks that do not. For the former, we take Euler's (1772) circles, provide a novel computational reconstruction, show how it captures abstractions, and contrast it with earlier construals and with Johnson‐Laird's (1983) mental models representations. We demonstrate equivalence of the graphical Euler system, and the nongraphical mental models system. For tasks not involving manipulation of external graphics, we discuss text comprehension, and the mental performance of syllogisms. By positing an internal system with the same specificity as Euler's circles, we cover the mental models data, and generate new empirical predictions. Finally, we consider how the architecture of working memory explains why such specific representations are relatively easy to store. (shrink)

This article discusses two coextensive concepts of logical consequence that are implicit in the two fundamental logical practices of establishing validity and invalidity for premise-conclusion arguments. The premises and conclusion of an argument have information content (they ?say? something), and they have subject matter (they are ?about? something). The asymmetry between establishing validity and establishing invalidity has long been noted: validity is established through an information-processing procedure exhibiting a step-by-step deduction of the conclusion from the premise-set. Invalidity is established by (...) exhibiting a countermodel satisfying the premises but not the conclusion. The process of establishing validity focuses on information content; the process of establishing invalidity focuses on subject matter. Corcoran's information-theoretic concept of logical consequence corresponds to the former. Tarski's model-theoretic concept of logical consequence formulated in his famous 1936 no-countermodels definition corresponds to the latter. Both are found to be indispensable for understanding the rationale of the deductive method and each complements the other. This study discusses the ontic question of the nature of logical consequence and the epistemic question of the human capabilities presupposed by practical applications of these two concepts as they make validity and invalidity accessible to human knowledge. (shrink)

By way of a close reading of Boole and Frege’s solutions to the same logical problem, we highlight an underappreciated aspect of Boole’s work—and of its difference with Frege’s better-known approach—which we believe sheds light on the concepts of ‘calculus’ and ‘mechanization’ and on their history. Boole has a clear notion of a logical problem; for him, the whole point of a logical calculus is to enable systematic and goal-directed solution methods for such problems. Frege’s Begriffsschrift, on the other hand, (...) is a visual tool to scrutinize concepts and inferences, and is a calculus only in the thin sense that every possible transition between sentences is fully and unambiguously specified in advance. While Frege’s outlook has dominated much of philosophical thinking about logical symbolism, we believe there is value—particularly in light of recent interest in the role of notations in mathematics and logic—in reviving Boole’s idea of an intrinsic link between, as he put it, a ‘calculus’ and a ‘directive method’ to solve problems. (shrink)

This work presents an operational and geometric approach to logic. It starts from the multilinear elective decomposition of binary logical functions in the original form introduced by George Boole. A justification on historical grounds is presented bridging Boole’s theory and the use of his arithmetical logical functions with the axioms of Boolean algebra using sets and quantum logic. It is shown that this algebraic polynomial formulation can be naturally extended to operators in finite vector spaces. Logical operators will appear as (...) commuting projection operators and the truth values, which take the binary values \, are the respective eigenvalues. In this view the solution of a logical proposition resulting from the operation on a combination of arguments will appear as a selection where the outcome can only be one of the eigenvalues. In this way propositional logic can be formalized in linear algebra by using elective developments which correspond here to combinations of tensored elementary projection operators. The original and principal motivation of this work is for applications in the new field of quantum information, differences are outlined with more traditional quantum logic approaches. (shrink)

This introduction aims to familiarize readers with basic dimensions of variation among pictorial and diagrammatic representations, as we understand them, in order to serve as a backdrop to the articles in this volume. Instead of trying to canvas the vast range of representational kinds, we focus on a few important axes of difference, and a small handful of illustrative examples. We begin in Section 1 with background: the distinction between pictures and diagrams, the concept of systems of representation, and that (...) of the properties of usage associated with signs. In Section 2 we illustrate these ideas with a case study of diagrammatic representation: the evolution from Euler diagrams to Venn diagrams. Section 3 is correspondingly devoted to pictorial representation, illustrated by the comparison between parallel and linear perspective drawing. We conclude with open questions, and then briefly summarize the articles to follow. (shrink)

Friedrich Albert Lange (1828-1875) author of a famous History of Materialism and Critique of Its Present Significance (1866, English transI. 1877-79, repr. 1925 with introduction by Bertrand Russell), was also interested in the epistemological foundations of formal logic. Part I of his intended two-volume Logische Studien was published posthumously in 1877 by Hermann Cohen, head of the Marburg school of neo-Kantianism. Lange, departing from Kant, claims that spatial intuition is the source of the apodeictic character not only of the truths (...) of mathematics, but also of the truths of logic. He aims at showing this by basing validity and invalidity of syllogistic inferences on an interpretation of the standard forms (of proposition in assertoric syllogistic) with the help of the five kinds of possible relations (in fact what is known today as the Gergonne-Euler relations) between extensions of concepts given to us as areas in a plane, i.e.in space. Generality is achieved by considering all possible variations within each type of spatial relation, exhibiting a connection between concept and intuition reminding Lange of the Kantian "schema". Lange is well aware of the contemporary English "algebraic" logic, but he considers its approach as the appropriate one for a logic of content (Inhaltslogik) and not for a logic of extension (Umfangslogik). Lange did not live to enjoy the recognition by some leading logicians (amongst them John Venn, to whose reference in 1881 to Lange's "admirable Logische Studien" the present paper owes it title), nor could he respond to the many critics of his proposed foundation of logic. Its radicality as well as its broad reception (and discussion up to at least 1959) seem to entitle Lange's Logische Studien to an, if modest, place in the history of logic in the 19th century. (shrink)

In formal logic there is a premium on clever paraphrase, for it subsumes troublesome inferences under a familiar theory. (A paradigm is Davidson's analysis 1967 of inferences like ?He buttered his toast with a knife; so, he buttered his toast?.) But the need for paraphrase in formal logic runs deeper than the odd recalcitrant inference, and thus, I shall argue, commits logicians to some interesting consequences. First, the thesis that arguments are valid in virtue of their form must be severely (...) qualified (?4). And second, it is misleading to view a formal logical theory as a standard for justifying and criticizing inference (?7). The latter point depends on the nature and role of paraphrase, which permit a range of conflicting logical theories. Conflicting logical theories arise from the conflicting goals of logical theorists and the promiscuous nature of paraphrase makes reconciliation impossible. (shrink)

Proof-theory has traditionally been developed based on linguistic (symbolic) representations of logical proofs. Recently, however, logical reasoning based on diagrammatic or graphical representations has been investigated by logicians. Euler diagrams were introduced in the eighteenth century. But it is quite recent (more precisely, in the 1990s) that logicians started to study them from a formal logical viewpoint. We propose a novel approach to the formalization of Euler diagrammatic reasoning, in which diagrams are defined not in terms of regions as in (...) the standard approach, but in terms of topological relations between diagrammatic objects. We formalize the unification rule, which plays a central role in Euler diagrammatic reasoning, in a style of natural deduction. We prove the soundness and completeness theorems with respect to a formal set-theoretical semantics. We also investigate structure of diagrammatic proofs and prove a normal form theorem. (shrink)

In current philosophy of information, different authors have been supporting the veridicality thesis (VT). According to this thesis, an epistemically-oriented concept of information must have truth as one of its necessary conditions. Two challenges can be raised against VT. First, some philosophers object that veridicalists erroneously ignore the informativeness of false messages. Secondly, it is not clear whether VT can adequately explain the information considered in hypothetical reasoning. In this sense, logical diagrams offer an interesting case of analysis: by manipulating (...) a logical diagram we can verify that a certain conclusion follows from a set of premises, but it cannot help us to determine the actual truth-value of a given set of propositions. Focusing on the latter challenge, in this paper I claim that logical diagrams set out potential counterexamples to VT and, consequently, pose a real challenge to this thesis. First, a veridicalist analysis of logical diagrams requires the assumption of metatheoretical properties which are not satisfied by some logical systems (and, consequently, are not satisfied by some systems of logical diagrams). So, VT does not fit well as a general framework for a theory of logical diagrammatic information. Secondly, based on semantic inferentialism, one can propose a normative interpretation of the inferential content of logical diagrams not exposed to the problems faced by VT. Moreover, there are several reasons to believe that veridicalism cannot accommodate such a normative interpretation. In other words, normativism represents a real (though still underexplored) alternative to veridicality. Due to these reasons, I conclude that, until further research, we should adopt a more parsimonious standpoint and say that logical diagrams provide inferential information simply. (shrink)

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)

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)

In this note we reproduce the book reviews that De Morgan wrote on Boole's and Jevons's first logical works. The most notable property of these documents is the mere fact of their existence and the absence of any reference to them in the specialized literature.

In 1866, the young John Venn published The Logic of Chance, motivated largely by the desire to correct what he saw as deep fallacies in the reasoning of historical determinists such as Henry Buckle and in the optimistic heralding of a true social science by Adolphe Quetelet. Venn accepted the inevitable determinism implied by the physical sciences, but denied that the stable social statistics cited by Buckle and Quetelet implied a similar determinism in human actions. Venn maintained that probability statements (...) were intelligible solely as projections of the ultimate frequency of an outcome in an unlimited series of trials and therefore led to no inferences about free will. An issue here was Venn's claim that although the aggregate probability may be stable, the individual events were completely irregular and, in fact, displayed randomness. Venn's concept of randomness was really apparent, or pseudo-, randomness, which could be totally determined. Ironically, Venn's frequentist position was very useful to the growing field of statistics, which could develop correlations and predictive models empirically without having to address implications for personal freedom or fatalism. (shrink)

This paper is concerned with De Morgan’s explanation of the validity of arguments that involve relational notions. It discusses De Morgan’s expansion of traditional logic aimed at accommodating those inferences, and makes the point that his endeavour is not successful in that the rules that made up his new logic are not sound. Nevertheless, the most important scholarly work on De Morgan’s logic, and contrary to that De Morgan’s mistake is not beyond repair. The rules that determine his new logic (...) are in fact monotonie replacement rules. And provided they are restricted in the correct way, these rules are demonstrably sound. (shrink)