symbolic logic or mathematical logic, formalized system of deductive logic, employing abstract symbols for the various aspects of natural language. Symbolic logic draws on the concepts and techniques of mathematics, notably set theory, and in turn has contributed to the development of the foundations of mathematics. Symbolic logic dates from the work of Augustus De Morgan and George Boole in the mid-19th cent. and was further developed by W. S. Jevons, C. S. Peirce, Ernst Schröder, Gottlob Frege, Giuseppe Peano, Bertrand Russell, A. N. Whitehead, David Hilbert, and others.

Truth-functional Analysis

The first part of symbolic logic is known as truth-functional analysis, the propositional calculus, or the sentential calculus; it deals with statements that can be assigned truth values (true or false). Combinations of these statements are called truth functions, and their truth values can be determined from the truth values of their components.

The basic connectives in truth-functional analysis are usually negation, conjunction, and alternation. The negation of a statement is false if the original statement is true and true if the original statement is false; negation corresponds to "it is not the case that," or simply "not" in ordinary language. The conjunction of two statements is true only if both are true; it is false in all other instances. Conjunction corresponds to "and" in ordinary language. The alternation, or disjunction, of two statements is false only if both are false and is true in all other instances; alternation corresponds to the nonexclusive sense of "or" in ordinary language (Lat. vel), as opposed to the exclusive "either … or … but not both" (Lat. aut).

Other connectives commonly used in truth-functional analysis are the conditional and the biconditional. The conditional, or implication, corresponds to "if … then" or "implies" in ordinary language, but only in a weak sense. The conditional is false only if the antecedent is true and the consequent is false; it is true in all other instances. This kind of implication, in which the connection between the antecedent and the consequent is merely formal, is known as material implication. The biconditional, or double implication, is the equivalence relation and is true only if the two statements have the same truth value, either true or false. In any truth function one may substitute an equivalent expression for all or any part of the function. The validity of arguments may be analyzed by assigning all possible combinations of truth values to the component statements; such an array of truth values is called a truth table.

The Predicate Calculus

There are many valid argument forms, however, that cannot be analyzed by truth-functional methods, e.g., the classic syllogism: "All men are mortal. Socrates is a man. Therefore Socrates is mortal." The syllogism and many other more complicated arguments are the subject of the predicate calculus, or quantification theory, which is based on the calculus of classes. The predicate calculus of monadic (one-variable) predicates, also called uniform quantification theory, has been shown to be complete and has a decision procedure, analogous to truth tables for truth-functional analysis, whereby the validity or invalidity of any statement can be determined. The general predicate calculus, or quantification theory, was also shown to be complete by Kurt Gödel, but Alonso Church subsequently proved (1936) that it has no possible decision procedure.

Analysis of the Foundations of Mathematics

Symbolic logic has been extended to a description and analysis of the foundations of mathematics, particularly number theory. Gödel also made (1931) the surprising discovery that number theory cannot be complete, i.e., that no matter what axioms are chosen as a basis for number theory, there will always be some true statements that cannot be deducted from them, although they can be proved within the larger context of symbolic logic. Since many branches of mathematics are ultimately based on number theory, this result has been interpreted by some as affirming that mathematics is an open, creative discipline whose possibilities cannot be delineated. The work of Gödel, Church, and others has led to the development of proof theory, or metamathematics, which deals with the nature of mathematics itself.

mathematical logic: see symbolic logic.

logic circuit, electric circuit whose output depends upon the input in a way that can be expressed as a function in symbolic logic; it has one or more binary inputs (capable of assuming either of two states, e.g., "on" or "off") and a single binary output. Logic circuits that perform particular functions are called gates. Basic logic circuits include the AND gate, the OR gate, and the NOT gate, which perform the logical functions AND, OR, and NOT. Logic circuits can be built from any binary electric or electronic devices, including switches, relays, electron tubes, solid-state diodes, and transistors; the choice depends upon the application and design requirements. Modern technology has produced integrated logic circuits, modules that perform complex logical functions. A major use of logic circuits is in electronic digital computers. Fluid logic circuits have been developed whose function depends on the flow of a liquid or gas rather than on an electric current.

logic, the systematic study of valid inference. A distinction is drawn between logical validity and truth. Validity merely refers to formal properties of the process of inference. Thus, a conclusion whose value is true may be drawn from an invalid argument, and one whose value is false, from a valid sequence. For example, the argument All professors are brilliant; Smith is a professor, therefore, Smith is brilliant is a valid inference, but the argument All professors are brilliant; Smith is brilliant; therefore, Smith is a professor is an invalid inference, even if Smith is a professor.

Aristotelian Logic

In Western thought, systematic logic is considered to have begun with Aristotle's collection of treatises, the Organon [tool]. Aristotle introduced the use of variables: While his contemporaries illustrated principles by the use of examples, Aristotle generalized, as in: All x are y; all y are z; therefore, all x are z. Aristotle posited three laws as basic to all valid thought: the law of identity, A is A; the law of contradiction, A cannot be both A and not A; and the law of the excluded middle, A must be either A or not A.

Aristotle believed that any logical argument could be reduced to a standard form, known as a syllogism. A syllogism is a sequence of three propositions: two premises and the conclusion. By varying the form of the proposition and the modifiers (such as all, no, and some), a few specific forms may be delimited. Although Aristotle was concerned with problems in modal logic and other minor branches, it is usually agreed that his major contribution in the field of logic was his elaboration of syllogistic logic; indeed, the Aristotelian statement of logic held sway in the Western world for 2,000 years. Nonetheless, various logicians did, during that time, take issue with parts of Aristotle's thought.

Post-Aristotelian Logic

One of Aristotle's tacit assumptions was that there is a correspondence linking the structures of reality, the mind, and language (and hence logic). This position came to be known in the Middle Ages as realism. The opposing school of thought, nominalism, is exemplified by William of Occam, a medieval logician, who maintained that the structure of language and logic corresponds only to the structure of the mind, not to that of reality. Since knowledge is a study of generalizations, while nature occurs in myriad single instances, the distinction between the world and our conception of it is stressed by the nominalists.

Inductive Reasoning

In the 19th cent. John Stuart Mill noticed the same dichotomy between man's generalizations and nature's instances, but moved toward a different conclusion. Mill held that the scientist or experimenter is not interested in moving from the general to the specific case, which characterizes deductive logic, but is concerned with inductive reasoning, moving from the specific to the general (see induction). For example, the statement The sun will rise tomorrow is not the result of a particular deductive process, but is based on a psychological calculation of general probability based on many specific past experiences. Mill's chief contribution to logic rests on his efforts to formulate rules of inductive logic. Although since the criticisms of David Hume there has been disagreement about the validity of induction, modern logicians have argued that inductive logic does not need justification any more than deductive logic does. The real problem is to establish rules of induction, just as Aristotle established rules of deduction.

Mathematics and Logic

With the development of symbolic logic by George Boole and Augustus De Morgan in the 19th cent., logic has been studied in more purely mathematical terms, and mathematical symbols have replaced ordinary language. Reference to external interpretations of the symbols (formulated in ordinary language) was also rejected by the formalist movement of the early 20th cent. Bertrand Russell and Alfred North Whitehead, in Principia Mathematica (3 vol., 1910-13), attempted to develop logical theory as the basis for mathematics. Pure formal logic attempts to prove that a logical system is dependent only on the perceptual recognition and valid manipulation of symbols and requires no interpretive reference to content.

Intuitionism, rejecting such formalism, holds that words and formulas have significance only as a reflection of activity in the mind. Thus a theorem has meaning only if it represents a mental construction of a mathematical or logical entity. Kurt Gödel, in the 1930s, brought forth his "incompleteness theorem," which demonstrates that an infinitude of propositions that are underivable from the axioms of a system nevertheless have the value of true within the system. Neither these Gödel Propositions, as they are called, nor their negations are provable. One implication for the modern logician is that Aristotle's law of the excluded middle (either A or not A) is neither so simple nor so self-evident as it once seemed.

fuzzy logic, a multivalued (as opposed to binary) logic developed to deal with imprecise or vague data. Classical logic holds that everything can be expressed in binary terms: 0 or 1, black or white, yes or no; in terms of Boolean algebra, everything is in one set or another but not in both. Fuzzy logic allows for partial membership in a set, values between 0 and 1, shades of gray, and maybe—it introduces the concept of the "fuzzy set." When the approximate reasoning of fuzzy logic is used with an expert system, logical inferences can be drawn from imprecise relationships. Fuzzy logic theory was developed by Lofti A. Zadeh at the Univ. of California in the mid 1960s. However, it was not applied commercially until 1987 when the Matsushita Industrial Electric Co. used it in a shower head that controlled water temperature. Fuzzy logic is now used to optimize automatically the wash cycle of a washing machine by sensing the load size, fabric mix, and quantity of detergent and has applications in the control of passenger elevators, household appliances, cameras, automobile subsystems, and smart weapons.

Philosophical study of the nature and scope of logic. Examples of questions raised in the philosophy of logic are: “In virtue of what features of reality are the laws of logic true?”; “How do we know the truths of logic?”; and “Could the laws of logic ever be falsified by experience?” The subject matter of logic has been variously characterized as the laws of thought, “the rules of right reasoning,” “the principles of valid argumentation,” “the use of certain words called logical constants,” and “truths based solely on the meanings of the terms they contain.”

Learn more about logic, philosophy of with a free trial on Britannica.com.

Formal systems incorporating modalities such as necessity, possibility, impossibility, contingency, strict implication, and certain other closely related concepts. The most straightforward way of constructing a modal logic is to add to some standard nonmodal logical system a new primitive operator intended to represent one of the modalities, to define other modal operators in terms of it, and to add axioms and/or transformation rules involving those modal operators. For example, one may add the symbol L, which means “It is necessary that,” to classical propositional calculus; thus, Lp is read as “It is necessary that p.” The possibility operator M (“It is possible that”) may be defined in terms of L as Mp = ¬L¬p (where ¬ means “not”). In addition to the axioms and rules of inference of classical propositional logic, such a system might have two axioms and one rule of inference of its own. Some characteristic axioms of modal logic are: (A1) Lp ⊃ p and (A2) L(p ⊃ q) ⊃ (Lp ⊃ Lq). The new rule of inference in this system is the Rule of Necessitation: If p is a theorem of the system, then so is Lp. Stronger systems of modal logic can be obtained by adding additional axioms. Some add the axiom Lp ⊃ LLp; others add the axiom Mp ⊃ LMp.

Learn more about modal logic with a free trial on Britannica.com.

Study of inference and argument. Inferences are rule-governed steps from one or more propositions, known as premises, to another proposition, called the conclusion. A deductive inference is one that is intended to be valid, where a valid inference is one in which the conclusion must be true if the premises are true (see deduction; validity). All other inferences are called inductive (see induction). In a narrow sense, logic is the study of deductive inferences. In a still narrower sense, it is the study of inferences that depend on concepts that are expressed by the “logical constants,” including: (1) propositional connectives such as “not,” (symbolized as ¬), “and” (symbolized as ∧), “or” (symbolized as ∨), and “if-then” (symbolized as ⊃), (2) the existential and universal quantifiers, “(∃x)” and “(∀x),” often rendered in English as “There is an x such that elipsis” and “For any (all) x, elipsis,” respectively, (3) the concept of identity (expressed by “=”), and (4) some notion of predication. The study of the logical constants in (1) alone is known as the propositional calculus; the study of (1) through (4) is called first-order predicate calculus with identity. The logical form of a proposition is the entity obtained by replacing all nonlogical concepts in the proposition by variables. The study of the relations between such uninterpreted formulas is called formal logic. Seealso deontic logic; modal logic.

Learn more about logic with a free trial on Britannica.com.

Logic based on the concept of fuzzy sets, in which membership is expressed in varying probabilities or degrees of truth—that is, as a continuum of values ranging from 0 (does not occur) to 1 (definitely occurs). As additional data are gathered, many fuzzy-logic systems are able to adjust the probability values assigned to different parameters. Because some such systems appear able to learn from their mistakes, they are often considered a crude form of artificial intelligence. The term and concept date from a 1965 paper by Lotfi A. Zadeh (born 1921). Fuzzy-logic systems achieved commercial application in the early 1990s. Advanced clothes-washing machines, for example, use fuzzy-logic systems to detect and adapt to patterns of water movement during a wash cycle, increasing efficiency and reducing water consumption. Other products using fuzzy logic include camcorders, microwave ovens, and dishwashers. Other applications include expert systems, self-regulating industrial controls, and computerized speech- and handwriting-recognition programs.

Learn more about fuzzy logic with a free trial on Britannica.com.