Logical graph

Last updated

A logical graph is a special type of diagrammatic structure of graphical syntax developed for logic (such as those developed by Charles Sanders Peirce).

In his papers on qualitative logic , entitative graphs , and existential graphs , Peirce developed several versions of a graphical formalism, or a graph-theoretic formal language, designed to be interpreted for logic.

In the century since Peirce initiated this line of development, a variety of formal graph-theoretic structures that have branched out from what is abstractly the same formal base.

See also

Commons-logo.svg Media related to Logical graphs at Wikimedia Commons

Related Research Articles

<span class="mw-page-title-main">Charles Sanders Peirce</span> American thinker who founded pragmatism (1839–1914)

Charles Sanders Peirce was an American scientist, mathematician, logician, and philosopher who is sometimes known as "the father of pragmatism". According to philosopher Paul Weiss, Peirce was "the most original and versatile of America's philosophers and America's greatest logician". Bertrand Russell wrote "he was one of the most original minds of the later nineteenth century and certainly the greatest American thinker ever".

<span class="mw-page-title-main">Discrete mathematics</span> Study of discrete mathematical structures

Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets. However, there is no exact definition of the term "discrete mathematics".

<span class="mw-page-title-main">Logic gate</span> Device performing a Boolean function

A logic gate is an idealized or physical device that performs a Boolean function, a logical operation performed on one or more binary inputs that produces a single binary output.

<span class="mw-page-title-main">Sheffer stroke</span> Logical operation

In Boolean functions and propositional calculus, the Sheffer stroke denotes a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both". It is also called non-conjunction, or alternative denial since it says in effect that at least one of its operands is false, or NAND. In digital electronics, it corresponds to the NAND gate. It is named after Henry Maurice Sheffer and written as or as or as or as in Polish notation by Łukasiewicz.

<span class="mw-page-title-main">Pragmaticism</span>

"Pragmaticism" is a term used by Charles Sanders Peirce for his pragmatic philosophy starting in 1905, in order to distance himself and it from pragmatism, the original name, which had been used in a manner he did not approve of in the "literary journals". Peirce in 1905 announced his coinage "pragmaticism", saying that it was "ugly enough to be safe from kidnappers". Today, outside of philosophy, "pragmatism" is often taken to refer to a compromise of aims or principles, even a ruthless search for mercenary advantage. Peirce gave other or more specific reasons for the distinction in a surviving draft letter that year and in later writings. Peirce's pragmatism, that is, pragmaticism, differed in Peirce's view from other pragmatisms by its commitments to the spirit of strict logic, the immutability of truth, the reality of infinity, and the difference between (1) actively willing to control thought, to doubt, to weigh reasons, and (2) willing not to exert the will, willing to believe. In his view his pragmatism is, strictly speaking, not itself a whole philosophy, but instead a general method for the clarification of ideas. He first publicly formulated his pragmatism as an aspect of scientific logic along with principles of statistics and modes of inference in his "Illustrations of the Logic of Science" series of articles in 1877-8.

<span class="mw-page-title-main">Conceptual graph</span>

A conceptual graph (CG) is a formalism for knowledge representation. In the first published paper on CGs, John F. Sowa used them to represent the conceptual schemas used in database systems. The first book on CGs applied them to a wide range of topics in artificial intelligence, computer science, and cognitive science.

Laws of Form is a book by G. Spencer-Brown, published in 1969, that straddles the boundary between mathematics and philosophy. LoF describes three distinct logical systems:

<span class="mw-page-title-main">Existential graph</span> Type of diagrammatic or visual notation for logical expressions

An existential graph is a type of diagrammatic or visual notation for logical expressions, proposed by Charles Sanders Peirce, who wrote on graphical logic as early as 1882, and continued to develop the method until his death in 1914.

An entitative graph is an element of the diagrammatic syntax for logic that Charles Sanders Peirce developed under the name of qualitative logic beginning in the 1880s, taking the coverage of the formalism only as far as the propositional or sentential aspects of logic are concerned. See 3.468, 4.434, and 4.564 in Peirce's Collected Papers. Peirce wrote of this system in an 1897 Monist article titled "The Logic of Relatives", although he had mentioned logical graphs in an 1882 letter to O. H. Mitchell.

<span class="mw-page-title-main">Charles Sanders Peirce bibliography</span>

This Charles Sanders Peirce bibliography consolidates numerous references to the writings of Charles Sanders Peirce, including letters, manuscripts, publications, and Nachlass. For an extensive chronological list of Peirce's works, see the Chronologische Übersicht on the Schriften (Writings) page for Charles Sanders Peirce.

In mathematical logic, algebraic logic is the reasoning obtained by manipulating equations with free variables.

<span class="mw-page-title-main">Diagrammatic reasoning</span>

Diagrammatic reasoning is reasoning by means of visual representations. The study of diagrammatic reasoning is about the understanding of concepts and ideas, visualized with the use of diagrams and imagery instead of by linguistic or algebraic means.

<span class="mw-page-title-main">Semiotic theory of Charles Sanders Peirce</span>

Charles Sanders Peirce began writing on semiotics, which he also called semeiotics, meaning the philosophical study of signs, in the 1860s, around the time that he devised his system of three categories. During the 20th century, the term "semiotics" was adopted to cover all tendencies of sign researches, including Ferdinand de Saussure's semiology, which began in linguistics as a completely separate tradition.

<span class="mw-page-title-main">Categories (Peirce)</span>

On May 14, 1867, the 27–year-old Charles Sanders Peirce, who eventually founded pragmatism, presented a paper entitled "On a New List of Categories" to the American Academy of Arts and Sciences. Among other things, this paper outlined a theory of predication involving three universal categories that Peirce continued to apply in philosophy and elsewhere for the rest of his life. The categories demonstrate and concentrate the pattern seen in "How to Make Our Ideas Clear", and other three-way distinctions in Peirce's work.

Diagrammatology is the academic study of diagrams. It studies fundamental role played by the diagram in the communication and creation of knowledge. Diagrammatology is not only an interdisciplinary subject, but pan-historical and cross-cultural.

In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula. For instance, the universal quantifier in the first order formula expresses that everything in the domain satisfies the property denoted by . On the other hand, the existential quantifier in the formula expresses that there exists something in the domain which satisfies that property. A formula where a quantifier takes widest scope is called a quantified formula. A quantified formula must contain a bound variable and a subformula specifying a property of the referent of that variable.

Kenneth Laine Ketner is an American philosopher. He is Paul Whitfield Horn Professor, Charles Sanders Peirce Interdisciplinary Professor and Director of Institute for Studies in Pragmaticism, Texas Tech University.

Sun-Joo Shin is a Korean-American philosopher known for her work on diagrammatic reasoning in mathematical logic, including the validity of reasoning using Venn diagrams, the existential graphs of Charles Sanders Peirce, and the philosophical distinction between diagrammatic and symbolic reasoning. She is a professor of philosophy at Yale University.