Classical logic

Classical logic identifies a class of formal logics that have been most intensively studied and most widely used. The class is sometimes called standard logic as well.^[1][2] They are characterised by a number of properties:^[3]

1. Law of the excluded middle and double negative elimination;
2. Law of noncontradiction, and the principle of explosion;
3. Monotonicity of entailment and idempotency of entailment;
4. Commutativity of conjunction;
5. logical operator is dual to another;

While not entailed by the preceding conditions, contemporary discussions of classical logic normally only include propositional and first-order logics.^[4][5]

The intended semantics of classical logic is bivalent. With the advent of algebraic logic it became apparent however that classical propositional calculus admits other semantics. In Boolean-valued semantics (for classical propositional logic), the truth values are the elements of an arbitrary Boolean algebra; "true" corresponds to the maximal element of the algebra, and "false" corresponds to the minimal element. Intermediate elements of the algebra correspond to truth values other than "true" and "false". The principle of bivalence holds only when the Boolean algebra is taken to be the two-element algebra, which has no intermediate elements.

Examples of classical logics

• syllogisms, which is a logic with a restricted form of judgments: assertions take one of four forms, All Ps are Q, Some Ps are Q, No Ps are Q, and Some Ps are not Q. These judgments find themselves if two pairs of two dual operators, and each operator is the negation of another, relationships that Aristotle summarised with his square of oppositions. Aristotle explicitly formulated the law of the excluded middle and law of non-contradiction in justifying his system, although these laws cannot be expressed as judgments within the syllogistic framework.
• Boolean logic;
• The first-order logic found in Gottlob Frege's Begriffsschrift.

Non-classical logics

• Computability logic is a semantically constructed formal theory of computability—as opposed to classical logic, which is a formal theory of truth—integrates and extends classical, linear and intuitionistic logics.
• Many-valued logic, including fuzzy logic, which rejects the law of the excluded middle and allows as a truth value any real number between 0 and 1.
• Linear logic rejects idempotency of entailment as well;
• Modal logic extends classical logic with non-truth-functional ("modal") operators.
• Paraconsistent logic (e.g., dialetheism and relevance logic) rejects the law of noncontradiction;
• Relevance logic, linear logic, and non-monotonic logic reject monotonicity of entailment;

In Deviant Logic, Fuzzy Logic: Beyond the Formalism, Susan Haack divided non-classical logics into deviant, quasi-deviant, and extended logics.^[5]

References

Further reading

• Graham Priest, An Introduction to Non-Classical Logic: From If to Is, 2nd Edition, CUP, 2008, ISBN 978-0-521-67026-5
• Warren Goldfard, "Deductive Logic", 1st edition, 2003, ISBN 0-87220-660-2

Classical logic Law of excluded middle Double negative elimination Law of noncontradiction Principle of explosion Monotonicity of entailment Idempotency of entailment Commutativity of conjunction Principle of bivalence Propositional logic Predicate logic