Classical logic: Difference between revisions
Appearance
Content deleted Content added
Guppyfinsoup (talk | contribs) m +comma |
Guppyfinsoup (talk | contribs) moving statement on deviant logic to ==Non-classical logics== section |
||
Line 5: | Line 5: | ||
#[[Commutativity of conjunction]]; |
#[[Commutativity of conjunction]]; |
||
#[[De Morgan duality]]: every [[logical operator]] is dual to another. |
#[[De Morgan duality]]: every [[logical operator]] is dual to another. |
||
⚫ | |||
Classical Logic is two-valued, i.e. it uses only [[Boolean-valued function]]s. |
Classical Logic is two-valued, i.e. it uses only [[Boolean-valued function]]s. |
||
Line 27: | Line 25: | ||
*[[Linear logic]] rejects idempotency of entailment as well; |
*[[Linear logic]] rejects idempotency of entailment as well; |
||
*[[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. |
*[[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. |
||
⚫ | |||
==References== |
==References== |
Revision as of 20:42, 8 October 2006
Classical logic identifies a class of formal logics that have been most intensively studied and most widely used. They are characterised by a number of properties; non-classical logics are those that lack one or more of these properties, which are:
- Law of the excluded middle and Double negative elimination;
- Law of noncontradiction;
- Monotonicity of entailment and Idempotency of entailment;
- Commutativity of conjunction;
- De Morgan duality: every logical operator is dual to another.
Classical Logic is two-valued, i.e. it uses only Boolean-valued functions.
Examples of classical logics
- Aristotle's Organon introduces his theory of syllogistic, which is a logic with a restricted form of judgements: 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 judgements 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 noncontradiction in justifying his system, although these laws cannot be expressed as judgements within the syllogistic framework.
- George Boole's algebraic reformulation of logic, his system of Boolean logic;
- Clarence Irving Lewis's systems S1-S5 of alethic modal logic.
Non-classical logics
- Intuitionistic logic rejects the law of the excluded middle, double negative elimination, and the De Morgan's laws;
- 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;
- Linear logic rejects idempotency of entailment as well;
- 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.
In Deviant Logic, Fuzzy Logic: Beyond the Formalism, Susan Haack divided non-classical logics into deviant, quasi-deviant, and extended logics.
References
- Dov Gabbay, (1994). 'Classical vs non-classical logic'. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, (Eds), Handbook of Logic in Artificial Intelligence and Logic Programming, volume 2, chapter 2.6. Oxford University Press.
- Susan Haack, (1996). Deviant Logic, Fuzzy Logic: Beyond the Formalism. Chicago: The University of Chicago Press.