Classical logic
55868
172047066
2007-11-17T06:43:31Z
BotMultichill
4080734
robot Adding: [[mk:Класична логика]]
'''Classical logic''' identifies a class of [[formal logic]]s that have been most intensively studied and most widely used. They are characterised by a number of properties<ref>[[Dov Gabbay|Gabbay, Dov]], (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.</ref>; 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 [[bivalence|bivalent]], i.e. it uses only [[Boolean-valued function]]s. And while not entailed by the preceding conditions, contemporary discussions of classical logic normally only include [[propositional logic|propositional]] and [[first-order logic|first-order]] logics.<ref>Shapiro, Stewart (2000). Classical Logic. In Stanford Encyclopedia of Philosophy [Web]. Stanford: The Metaphysics Research Lab. Retrieved October 28, 2006, from http://plato.stanford.edu/entries/logic-classical/</ref><ref name="haack">[[Susan Haack|Haack, Susan]], (1996). ''Deviant Logic, Fuzzy Logic: Beyond the Formalism''. Chicago: The University of Chicago Press.</ref>
==Examples of classical logics==
*[[Aristotle]]'s [[Organon]] introduces his theory of [[syllogism]]s, 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 opposition]]s. 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.
*[[George Boole]]'s algebraic reformulation of logic, his system of [[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.
*[[Fuzzy logic]] rejects the law of the excluded middle and allows as a truth value any real number between 0 and 1.
*[[Intuitionistic logic]] rejects the law of the excluded middle, double negative elimination, and the De Morgan's laws;
*[[Linear logic]] rejects idempotency of entailment as well;
*[[Modal logic]] extends classical logic with [[Truth function|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 logic|deviant]], quasi-deviant, and extended logics.<ref name="haack" />
==References==
<references />
{{portalpar|Logic}}
{{Logic}}
[[Category:Logic]]
[[de:Klassische Logik]]
[[it:Logica classica]]
[[mk:Класична логика]]
[[nl:Klassieke logica]]
[[ru:Классическая логика]]
[[zh:经典逻辑]]