Jump to content

Symbolic logic

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 59.94.137.18 (talk) at 09:04, 9 September 2008 (Predicate logic). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Symbolic logic is the area of mathematics which studies the purely formal properties of strings of symbols. The interest in this area springs from two sources. First, the symbols used in symbolic logic can be seen as representing the words used in philosophical logic. Second, the rules for manipulating symbols found in symbolic logic can be implemented on a computing machine.

Symbolic logic is usually divided into two subfields, propositional logic and predicate logic. Other logics of interest include temporal logic, modal logic and fuzzy logic. See also model theory.

Modern mathematical areas arising out of formal logic are grouped under the heading mathematical logic.

Propositional logic

The area of symbolic logic called propositional logic, originally called propositional calculus but not to be confused with the school subject calculus, studies the properties of sentences formed from constants, usually designated A, B, C, ... and five logical operators, AND, OR, IMPLIES, EQUALS and NOT. The corresponding logical operations are known, respectively, as conjunction, disjunction, material conditional, biconditional, and negation. These five operators are sometimes denoted as keywords, especially in computer languages, and sometimes by special symbols (see Table of logic symbols). All

Predicate logic

Predicate logic,

See also