Difference between revisions of "Logical negation"
MyWikiBiz, Author Your Legacy — Sunday December 05, 2021
Jump to navigationJump to searchJon Awbrey (talk | contribs) |
Jon Awbrey (talk | contribs) |
||
Line 179: | Line 179: | ||
[[Category:Open Educational Resource]] | [[Category:Open Educational Resource]] | ||
[[Category:Peer Educational Resource]] | [[Category:Peer Educational Resource]] | ||
+ | [[Category:Charles Sanders Peirce]] | ||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
[[Category:Formal Languages]] | [[Category:Formal Languages]] |
Revision as of 01:04, 2 November 2011
☞ This page belongs to resource collections on Logic and Inquiry.
Logical 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.
The truth table of NOT p (also written as ~p or ¬p) is as follows:
p | ¬p |
---|---|
F | T |
T | F |
The logical 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 |
---|---|
\(\bar{p}\) | bar p |
\(p'\!\) | p prime, p complement |
\(!p\!\) | bang p |
Syllabus
Focal nodes
Template:Col-breakTemplate:Col-breakTemplate:Col-endPeer nodes
Logical operators
Related topics
- Propositional calculus
- Sole sufficient operator
- Truth table
- Universe of discourse
- Zeroth order logic
Relational concepts
Information, Inquiry
Related articles
Document history
Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.
<sharethis />