Non-Aristotelian logic
   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 form ...
s that differ in a significant way from standard logical systems such as propositional and
predicate Predicate or predication may refer to: * Predicate (grammar), in linguistics * Predication (philosophy) * several closely related uses in mathematics and formal logic: **Predicate (mathematical logic) **Propositional function **Finitary relation, o ...
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 whic ...
. Philosophical logic 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 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 circumscribe the ...
can be thought of as using non-classical reasoning, although this varies according to the subject area. For example, the basic boolean functions (e.g.
AND or AND may refer to: Logic, grammar, and computing * Conjunction (grammar), connecting two words, phrases, or clauses * Logical conjunction in mathematical logic, notated as "∧", "⋅", "&", or simple juxtaposition * Bitwise AND, a boolea ...
, 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 (includi ...
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, boolean functions, and propositional calculus—which sets out the functional values of logical expressions on each of their functional argumen ...
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 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 pro ...
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, 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, systems ...
rejects the
law of the 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 noncontradi ...
,
double negation elimination In propositional logic, double negation is the theorem that states that "If a statement is true, then it is not the case that the statement is not true." This is expressed by saying that a proposition ''A'' is logically equivalent to ''not (not ...
, 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 math ...
; * Linear logic rejects
idempotency Idempotence (, ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of pl ...
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 (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 Dialetheism (from Greek 'twice' and 'truth') is the view that there are statements that are both true and false. More precisely, it is the belief that there can be a true statement whose negation is also true. Such statements are called "true ...
; *
Quantum logic In the mathematical study of logic and the physical analysis of quantum foundations, quantum logic is a set of rules for manipulation of propositions inspired by the structure of quantum theory. The field takes as its starting point an observ ...
*
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, and
non-monotonic logic A non-monotonic logic is a formal logic whose conclusion relation is not monotonic. In other words, non-monotonic logics are devised to capture and represent defeasible inferences (cf. defeasible reasoning), i.e., a kind of inference in which re ...
reject monotonicity of entailment; * Non-reflexive logic (also known as "Schrödinger logics") rejects or restricts the
law of identity In logic, the law of identity states that each thing is identical with itself. It is the first of the historical three laws of thought, along with the law of noncontradiction, and the law of excluded middle. However, few systems of logic are bui ...
;


Classification of non-classical logics according to specific authors

In ''Deviant Logic'' (1974)
Susan Haack Susan Haack (born 1945) is a distinguished professor in the humanities, Cooper Senior Scholar in Arts and Sciences, professor of philosophy, and professor of law at the University of Miami in Coral Gables, Florida. Haack has written on logic, ...
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 constant In logic, a logical constant of a language \mathcal is a symbol that has the same semantic value under every interpretation of \mathcal. Two important types of logical constants are logical connectives and quantifiers. The equality predicate (us ...
s 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 ...
s generated is a
proper superset In mathematics, set ''A'' is a subset of a set ''B'' if all elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are unequal, then ''A'' is a proper subset of ...
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 t ...
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 mathematical logic, a conservative extension is a supertheory of a theory which is often convenient for proving theorems, but proves no new theorems about the language of the original theory. Similarly, a non-conservative extension is a superthe ...
.) 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 noncontradi ...
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 logics 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: 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 The development of Indian logic dates back to the ''anviksiki'' of Medhatithi Gautama (c. 6th century BCE); the Sanskrit grammar rules of Pāṇini (c. 5th century BCE); the Vaisheshika school's analysis of atomism (c. 6th century BCE to 2nd centur ...


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