HOME

TheInfoList



OR:

Non-classical logics (and sometimes alternative logics) are
formal system A formal system is an abstract structure used for inferring theorems from axioms according to a set of rules. These rules, which are used for carrying out the inference of theorems from axioms, are the logical calculus of the formal system. A for ...
s that differ in a significant way from standard logical systems such as propositional and predicate logic. There are several ways in which this is done, including by way of extensions, deviations, and variations. The aim of these departures is to make it possible to construct different models of logical consequence and
logical truth Logical truth is one of the most fundamental concepts in logic. Broadly speaking, a logical truth is a statement which is true regardless of the truth or falsity of its constituent propositions. In other words, a logical truth is a statement whi ...
.
Philosophical logic Understood in a narrow sense, philosophical logic is the area of logic that studies the application of logical methods to philosophical problems, often in the form of extended logical systems like modal logic. Some theorists conceive philosophical ...
is understood to encompass and focus on non-classical logics, although the term has other meanings as well. In addition, some parts of
theoretical computer science Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory. It is difficult to circumsc ...
can be thought of as using non-classical reasoning, although this varies according to the subject area. For example, the basic
boolean Any kind of logic, function, expression, or theory based on the work of George Boole is considered Boolean. Related to this, "Boolean" may refer to: * Boolean data type, a form of data with only two possible values (usually "true" and "false" ...
functions (e.g. AND, OR, NOT, etc) in
computer science Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to practical disciplines (includin ...
are very much classical in nature, as is clearly the case given that they can be fully described by classical
truth table A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra (logic), Boolean algebra, boolean functions, and propositional calculus—which sets out the functional values of logical expression (mathematics) ...
s. However, in contrast, some computerized proof methods may not use classical logic in the reasoning process.


Examples of non-classical logics

There are many kinds of non-classical logic, which include: *
Computability logic Computability logic (CoL) is a research program and mathematical framework for redeveloping logic as a systematic formal theory of computability, as opposed to classical logic which is a formal theory of truth. It was introduced and so named by ...
is a semantically constructed formal theory of computability—as opposed to classical logic, which is a formal theory of truth—that integrates and extends classical, linear and intuitionistic logics. *
Dynamic semantics Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context. In static semantics, knowing the meaning of a sentence amounts to knowing when it is true; in dynam ...
interprets formulas as update functions, opening the door to a variety of nonclassical behaviours *
Many-valued logic Many-valued logic (also multi- or multiple-valued logic) refers to a propositional calculus in which there are more than two truth values. Traditionally, in Aristotle's logical calculus, there were only two possible values (i.e., "true" and "false ...
rejects bivalence, allowing for
truth value In logic and mathematics, a truth value, sometimes called a logical value, is a value indicating the relation of a proposition to truth, which in classical logic has only two possible values ('' true'' or ''false''). Computing In some prog ...
s other than true and false. The most popular forms are
three-valued logic In logic, a three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating ''true'', ''false'' and some indeterminate ...
, as initially developed by
Jan Łukasiewicz Jan Łukasiewicz (; 21 December 1878 – 13 February 1956) was a Polish logician and philosopher who is best known for Polish notation and Łukasiewicz logic His work centred on philosophical logic, mathematical logic and history of logic. ...
, and infinitely-valued logics such as
fuzzy logic Fuzzy logic is a form of many-valued logic in which the truth value of variables may be any real number between 0 and 1. It is employed to handle the concept of partial truth, where the truth value may range between completely true and complet ...
, which permit any real number between 0 and 1 as a truth value. *
Intuitionistic logic Intuitionistic logic, sometimes more generally called constructive logic, refers to systems of symbolic logic that differ from the systems used for classical logic by more closely mirroring the notion of constructive proof. In particular, system ...
rejects the law of the excluded middle, double negation elimination, and part of
De Morgan's laws In propositional logic and Boolean algebra, De Morgan's laws, also known as De Morgan's theorem, are a pair of transformation rules that are both valid rules of inference. They are named after Augustus De Morgan, a 19th-century British mathem ...
; *
Linear logic Linear logic is a substructural logic proposed by Jean-Yves Girard as a refinement of classical and intuitionistic logic, joining the dualities of the former with many of the constructive properties of the latter. Although the logic has also ...
rejects idempotency of
entailment Logical consequence (also entailment) is a fundamental concept in logic, which describes the relationship between statements that hold true when one statement logically ''follows from'' one or more statements. A valid logical argument is one ...
as well; * Modal logic extends classical logic with non-truth-functional ("modal") operators. *
Paraconsistent logic A paraconsistent logic is an attempt at a logical system to deal with contradictions in a discriminating way. Alternatively, paraconsistent logic is the subfield of logic that is concerned with studying and developing "inconsistency-tolerant" syst ...
(e.g.,
relevance logic Relevance logic, also called relevant logic, is a kind of non- classical logic requiring the antecedent and consequent of implications to be relevantly related. They may be viewed as a family of substructural or modal logics. It is generally, but ...
) rejects the
principle of explosion In classical logic, intuitionistic logic and similar logical systems, the principle of explosion (, 'from falsehood, anything ollows; or ), or the principle of Pseudo-Scotus, is the law according to which any statement can be proven from a ...
, and has a close relation to dialetheism; * Quantum logic *
Relevance logic Relevance logic, also called relevant logic, is a kind of non- classical logic requiring the antecedent and consequent of implications to be relevantly related. They may be viewed as a family of substructural or modal logics. It is generally, but ...
,
linear logic Linear logic is a substructural logic proposed by Jean-Yves Girard as a refinement of classical and intuitionistic logic, joining the dualities of the former with many of the constructive properties of the latter. Although the logic has also ...
, and non-monotonic logic reject monotonicity of entailment; * Non-reflexive logic (also known as "Schrödinger logics") rejects or restricts the law of identity;


Classification of non-classical logics according to specific authors

In ''Deviant Logic'' (1974) Susan Haack divided non-classical logics into deviant, quasi-deviant, and extended logics. The proposed classification is non-exclusive; a logic may be both a deviation and an extension of classical logic. A few other authors have adopted the main distinction between deviation and extension in non-classical logics. John P. Burgess uses a similar classification but calls the two main classes anti-classical and extra-classical. Although some systems of classification for non-classical logic have been proposed, such as those of Haack and Burgess as described above for example, many people who study non-classical logic ignore these classification systems. As such, none of the classification systems in this section should be treated as standard. In an ''extension'', new and different logical constants are added, for instance the "\Box" in modal logic, which stands for "necessarily." In extensions of a logic, * the set of
well-formed formula In mathematical logic, propositional logic and predicate logic, a well-formed formula, abbreviated WFF or wff, often simply formula, is a finite sequence of symbols from a given alphabet that is part of a formal language. A formal language can be ...
s generated is a proper superset of the set of well-formed formulas generated by classical logic. * the set of
theorem In mathematics, a theorem is a statement that has been proved, or can be proved. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of ...
s generated is a proper superset of the set of theorems generated by classical logic, but only in that the novel theorems generated by the extended logic are only a result of novel well-formed formulas. (See also Conservative extension.) In a ''deviation'', the usual logical constants are used, but are given a different meaning than usual. Only a subset of the theorems from the classical logic hold. A typical example is intuitionistic logic, where the
law of excluded middle In logic, the law of excluded middle (or the principle of excluded middle) states that for every proposition, either this proposition or its negation is true. It is one of the so-called three laws of thought, along with the law of noncontradic ...
does not hold. Additionally, one can identify a ''variations'' (or ''variants''), where the content of the system remains the same, while the notation may change substantially. For instance many-sorted predicate logic is considered a just variation of predicate logic. This classification ignores however semantic equivalences. For instance, Gödel showed that all theorems from intuitionistic logic have an equivalent theorem in the classical modal logic S4. The result has been generalized to
superintuitionistic logic In mathematical logic, a superintuitionistic logic is a propositional logic extending intuitionistic logic. Classical logic is the strongest consistent superintuitionistic logic; thus, consistent superintuitionistic logics are called intermediate l ...
s and extensions of S4. The theory of abstract algebraic logic has also provided means to classify logics, with most results having been obtained for propositional logics. The current algebraic hierarchy of propositional logics has five levels, defined in terms of properties of their
Leibniz operator In abstract algebraic logic, a branch of mathematical logic, the Leibniz operator is a tool used to classify deductive systems, which have a precise technical definition and capture a large number of logics. The Leibniz operator was introduced by W ...
: protoalgebraic, (finitely) equivalential, and (finitely) algebraizable. Also online:


See also

* Logic in Eastern philosophy **
Logic in China Formal logic in China has a special place in the history of logic due to its length of and relative isolation to the strong ancient adoption and continued current of development of the study of logic in Europe, India, and the Islamic world. Mohis ...
** Logic in India


References


Further reading

* * A revised version was published as * Brief introduction to non-classical logics, with a primer on the classical one. * Chapters 7-16 cover the main non-classical logics of broad interest today. * Probably covers more logics than any of the other titles in this section; a large part of this 1500-page monograph is cross-sectional, comparing—as its title implies—the
logical connective In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. They can be used to connect logical formulas. For instance in the syntax of propositional logic, the binary ...
s in various logics; decidability and complexity aspects are generally omitted though.


External links


Video of Graham Priest & Maureen Eckert on Deviant Logic
{{Non-classical logic History of logic Logic Philosophy of logic