Definition[edit] No agreement exists as to the possibility of defining negation, as to its logical status, function, and meaning, as to its field of applicability..., and as to the interpretation of the negative judgment, (F.H. Heinemann 1944).[1] Classical negation is an operation on one logical value, typically the value of a proposition, that produces a value of true when its operand is false and a value of false when its operand is true. So, if statement A is true, then ¬A (pronounced "not A") would therefore be false; and conversely, if ¬A is false, then A would be true. The truth table of ¬p is as follows: Truth table of ¬p p ¬p True False False True Classical negation can be defined in terms of other logical operations. For example, ¬p can be defined as p → F, where "→" is logical consequence and F is absolute falsehood. Conversely, one can define F as p & ¬p for any proposition p, where "&" is logical conjunction. The idea here is that any contradiction is false. While these ideas work in both classical and intuitionistic logic, they do not work in paraconsistent logic, where contradictions are not necessarily false. But in classical logic, we get a further identity: p → q can be defined as ¬p ∨ q, where "∨" is logical disjunction: "not p, or q". Algebraically, classical negation corresponds to complementation in a Boolean algebra, and intuitionistic negation to pseudocomplementation in a Heyting algebra. These algebras provide a semantics for classical and intuitionistic logic respectively.

Notation[edit] The negation of a proposition p is notated in different ways in various contexts of discussion and fields of application. Among these variants are the following: Notation Vocalization ~p Not p −p Not p Np En p ¬p Not p p ′ {\displaystyle p'\!} p prime, p complement p ¯ {\displaystyle {\bar {p}}} p bar, Bar p ! p {\displaystyle !p\!} Bang p Not p In set theory \ is also used to indicate 'not member of': U \ A is the set of all members of U that are not members of A. No matter how it is notated or symbolized, the negation ¬p / −p can be read as "it is not the case that p", "not that p", or usually more simply as "not p".

Properties[edit] Double negation[edit] Within a system of classical logic, double negation, that is, the negation of the negation of a proposition p, is logically equivalent to p. Expressed in symbolic terms, ¬¬p ⇔ p. In intuitionistic logic, a proposition implies its double negation but not conversely. This marks one important difference between classical and intuitionistic negation. Algebraically, classical negation is called an involution of period two. However, in intuitionistic logic we do have the equivalence of ¬¬¬p and ¬p. Moreover, in the propositional case, a sentence is classically provable if its double negation is intuitionistically provable. This result is known as Glivenko's theorem. Distributivity[edit] De Morgan's laws provide a way of distributing negation over disjunction and conjunction : ¬ ( a ∨ b ) ≡ ( ¬ a ∧ ¬ b ) {\displaystyle \neg (a\vee b)\equiv (\neg a\wedge \neg b)} , and ¬ ( a ∧ b ) ≡ ( ¬ a ∨ ¬ b ) {\displaystyle \neg (a\wedge b)\equiv (\neg a\vee \neg b)} . Linearity[edit] Let ⊕ denote the logical xor operation. In Boolean algebra, a linear function is one such that: If there exists a0, a1, ..., an ∈ {\displaystyle \in } {0,1} such that f(b1, ..., bn) = a0 ⊕ (a1 ∧ {\displaystyle \land } b1) ⊕ ... ⊕ (an ∧ {\displaystyle \land } bn), for all b1, ..., bn ∈ {\displaystyle \in } {0,1}. Another way to express this is that each variable always makes a difference in the truth-value of the operation or it never makes a difference. Negation is a linear logical operator. Self dual[edit] In Boolean algebra a self dual function is one such that: f(a1, ..., an) = ~f(~a1, ..., ~an) for all a1, ..., an ∈ {\displaystyle \in } {0,1}. Negation is a self dual logical operator.

Rules of inference[edit] There are a number of equivalent ways to formulate rules for negation. One usual way to formulate classical negation in a natural deduction setting is to take as primitive rules of inference negation introduction (from a derivation of p to both q and ¬q, infer ¬p; this rule also being called reductio ad absurdum), negation elimination (from p and ¬p infer q; this rule also being called ex falso quodlibet), and double negation elimination (from ¬¬p infer p). One obtains the rules for intuitionistic negation the same way but by excluding double negation elimination. Negation introduction states that if an absurdity can be drawn as conclusion from p then p must not be the case (i.e. p is false (classically) or refutable (intuitionistically) or etc.). Negation elimination states that anything follows from an absurdity. Sometimes negation elimination is formulated using a primitive absurdity sign ⊥. In this case the rule says that from p and ¬p follows an absurdity. Together with double negation elimination one may infer our originally formulated rule, namely that anything follows from an absurdity. Typically the intuitionistic negation ¬p of p is defined as p→⊥. Then negation introduction and elimination are just special cases of implication introduction (conditional proof) and elimination (modus ponens). In this case one must also add as a primitive rule ex falso quodlibet.

Programming[edit] As in mathematics, negation is used in computer science to construct logical statements. if (!(r == t)) { /*...statements executed when r does NOT equal t...*/ } The "!" signifies logical NOT in B, C, and languages with a C-inspired syntax such as C++, Java, JavaScript, Perl, and PHP. "NOT" is the operator used in ALGOL 60, BASIC, and languages with an ALGOL- or BASIC-inspired syntax such as Pascal, Ada, Eiffel and Seed7. Some languages (C++, Perl, etc.) provide more than one operator for negation. A few languages like PL/I and Ratfor use ¬ for negation. Some modern computers and operating systems will display ¬ as ! on files encoded in ASCII. Most modern languages allow the above statement to be shortened from if (!(r == t)) to if (r != t), which allows sometimes, when the compiler/interpreter is not able to optimize it, faster programs. In computer science there is also bitwise negation. This takes the value given and switches all the binary 1s to 0s and 0s to 1s. See bitwise operation. This is often used to create ones' complement or "~" in C or C++ and two's complement (just simplified to "-" or the negative sign since this is equivalent to taking the arithmetic negative value of the number) as it basically creates the opposite (negative value equivalent) or mathematical complement of the value (where both values are added together they create a whole). To get the absolute (positive equivalent) value of a given integer the following would work as the "-" changes it from negative to positive (it is negative because "x < 0" yields true) unsigned int abs(int x) { if (x < 0) return -x; else return x; } To demonstrate logical negation: unsigned int abs(int x) { if (!(x < 0)) return x; else return -x; } Inverting the condition and reversing the outcomes produces code that is logically equivalent to the original code, i.e. will have identical results for any input (note that depending on the compiler used, the actual instructions performed by the computer may differ). This convention occasionally surfaces in written speech, as computer-related slang for not. The phrase !voting, for example, means "not voting".

Kripke semantics[edit] In Kripke semantics where the semantic values of formulae are sets of possible worlds, negation can be taken to mean set-theoretic complementation.[citation needed] (See also possible world semantics.)

See also[edit] Logical conjunction Logical disjunction NOT gate Bitwise NOT Ampheck Apophasis Binary opposition Cyclic negation Double negative elimination Grammatical polarity Negation (linguistics) Negation as failure Plato's beard Square of opposition

References[edit] ^ Horn, Laurence R (2001). "Chapter 1". A NATURAL HISTORY OF NEGATION (PDF). Stanford University: CLSI Publications. p. 1. ISBN 1-57586-336-7. Retrieved 29 Dec 2013.

Further reading[edit] Gabbay, Dov, and Wansing, Heinrich, eds., 1999. What is Negation?, Kluwer. Horn, L., 2001. A Natural History of Negation, University of Chicago Press. G. H. von Wright, 1953–59, "On the Logic of Negation", Commentationes Physico-Mathematicae 22. Wansing, Heinrich, 2001, "Negation", in Goble, Lou, ed., The Blackwell Guide to Philosophical Logic, Blackwell. Tettamanti, Marco; Manenti, Rosa; Della Rosa, Pasquale A.; Falini, Andrea; Perani, Daniela; Cappa, Stefano F.; Moro, Andrea (2008). "Negation in the brain: Modulating action representation". NeuroImage. 43 (2): 358–367. doi:10.1016/j.neuroimage.2008.08.004. PMID 18771737.

External links[edit] Horn, Laurence R.; Wansing, Heinrich. "Negation". In Zalta, Edward N. Stanford Encyclopedia of Philosophy. Hazewinkel, Michiel, ed. (2001) [1994], "Negation", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4 NOT, on MathWorld v t e Logical connectives Tautology/True ⊤ {\displaystyle \top } Alternative denial (NAND gate) ↑ {\displaystyle \uparrow } Converse implication ← {\displaystyle \leftarrow } Implication (IMPLY gate) → {\displaystyle \rightarrow } Disjunction (OR gate) ∨ {\displaystyle \lor } Negation (NOT gate) ¬ {\displaystyle \neg } Exclusive or (XOR gate) ↮ {\displaystyle \nleftrightarrow } Biconditional (XNOR gate) ↔ {\displaystyle \leftrightarrow } Statement Joint denial (NOR gate) ↓ {\displaystyle \downarrow } Nonimplication ↛ {\displaystyle \nrightarrow } Converse nonimplication ↚ {\displaystyle \nleftarrow } Conjunction (AND gate) ∧ {\displaystyle \land } Contradiction/False ⊥ {\displaystyle \bot } v t e Common logical symbols ∧ or & and ∨ or ¬ or ~ not → implies ⊃ implies, superset ≡ iff | nand ∀ universal quantification ∃ existential quantification ⊤ tautology ⊥ false, contradiction ⊢ entails, proves ⊨ entails, therefore ∴ therefore ∵ because Retrieved from "https://en.wikipedia.org/w/index.php?title=Negation&oldid=826391228" Categories: GrammarSemanticsLogical connectivesNegative conceptsUnary operationsHidden categories: Articles lacking in-text citations from March 2013All articles lacking in-text citationsUse dmy dates from September 2010All articles with unsourced statementsArticles with unsourced statements from August 2012

Navigation menu Personal tools Not logged inTalkContributionsCreate accountLog in Namespaces ArticleTalk Variants Views ReadEditView history More Search Navigation Main pageContentsFeatured contentCurrent eventsRandom articleDonate to WikipediaWikipedia store Interaction HelpAbout WikipediaCommunity portalRecent changesContact page Tools What links hereRelated changesUpload fileSpecial pagesPermanent linkPage informationWikidata itemCite this page Print/export Create a bookDownload as PDFPrintable version Languages العربيةCatalàČeštinaDanskDeutschEestiEmiliàn e rumagnòlEspañolEsperantoفارسیFrançais한국어Հայերենहिन्दीHrvatskiBahasa IndonesiaItalianoעבריתҚазақшаLatinaMagyarМакедонскиBahasa MelayuNederlands日本語Norskភាសាខ្មែរPiemontèisPolskiPortuguêsРусскийShqipSimple EnglishSlovenčinaSlovenščinaСрпски / srpskiSrpskohrvatski / српскохрватскиSvenskaไทยТоҷикӣУкраїнська中文 Edit links This page was last edited on 18 February 2018, at 21:15. Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Developers Cookie statement Mobile view (window.RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgPageParseReport":{"limitreport":{"cputime":"0.224","walltime":"0.358","ppvisitednodes":{"value":1517,"limit":1000000},"ppgeneratednodes":{"value":0,"limit":1500000},"postexpandincludesize":{"value":57493,"limit":2097152},"templateargumentsize":{"value":6699,"limit":2097152},"expansiondepth":{"value":12,"limit":40},"expensivefunctioncount":{"value":3,"limit":500},"entityaccesscount":{"value":0,"limit":400},"timingprofile":["100.00% 248.253 1 -total"," 18.13% 44.997 1 Template:More_footnotes"," 15.38% 38.176 1 Template:Reflist"," 13.78% 34.209 1 Template:Ambox"," 13.61% 33.783 1 Template:Common_logical_symbols"," 12.91% 32.055 1 Template:Cite_book"," 11.02% 27.365 1 Template:Navbox_with_columns"," 10.51% 26.103 2 Template:Navbox"," 9.44% 23.441 1 Template:Springer"," 8.81% 21.878 1 Template:Other_uses"]},"scribunto":{"limitreport-timeusage":{"value":"0.076","limit":"10.000"},"limitreport-memusage":{"value":3256753,"limit":52428800}},"cachereport":{"origin":"mw1284","timestamp":"20180218211524","ttl":1900800,"transientcontent":false}}});});(window.RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgBackendResponseTime":75,"wgHostname":"mw1262"});});

view link view link view link view link view link |