https://bsccs.stoney-wiki.com/w/index.php?action=history&feed=atom&title=Peirce_arrowPeirce arrow - Revision history2026-05-04T20:08:10ZRevision history for this page on the wikiMediaWiki 1.39.6https://bsccs.stoney-wiki.com/w/index.php?title=Peirce_arrow&diff=32&oldid=prevBfh-sts: Created page with "= Peirce arrow = The Peirce arrow (also called ''NOR'') is a logical operation that returns true only when both propositions are false. It is functionally complete, meaning all other logical operations can be expressed in terms of it. == Symbols == * p ↓ q (mathematical notation) * p NOR q (common name) * ¬(p ∨ q) (definition) == Definition == The Peirce arrow produces the negation of disjunction. == Truth Table == {| class="wikitable" ! p !! q !! p ↓ q |- |..."2025-10-20T13:29:17Z<p>Created page with "= Peirce arrow = The Peirce arrow (also called ''NOR'') is a logical operation that returns true only when both propositions are false. It is functionally complete, meaning all other logical operations can be expressed in terms of it. == Symbols == * p ↓ q (mathematical notation) * p NOR q (common name) * ¬(p ∨ q) (definition) == Definition == The Peirce arrow produces the negation of disjunction. == Truth Table == {| class="wikitable" ! p !! q !! p ↓ q |- |..."</p>
<p><b>New page</b></p><div>= Peirce arrow =<br />
<br />
The Peirce arrow (also called ''NOR'') is a logical operation that returns true only when both propositions are false. <br />
It is functionally complete, meaning all other logical operations can be expressed in terms of it.<br />
<br />
== Symbols ==<br />
* p ↓ q (mathematical notation)<br />
* p NOR q (common name)<br />
* ¬(p ∨ q) (definition)<br />
<br />
== Definition ==<br />
The Peirce arrow produces the negation of disjunction.<br />
<br />
== Truth Table ==<br />
{| class="wikitable"<br />
! p !! q !! p ↓ q<br />
|-<br />
| T || T || F<br />
|-<br />
| T || F || F<br />
|-<br />
| F || T || F<br />
|-<br />
| F || F || T<br />
|}<br />
<br />
== Examples ==<br />
* If ''p'' = "I will travel" and ''q'' = "I will study", <br />
then ''p ↓ q'' = "It is not the case that I will travel or study" (meaning: I do neither).<br />
* In Python: <code>not (p or q)</code><br />
* In Java: <code>!(p || q)</code><br />
<br />
<br />
[[Category:Propositional logic (Aussagenlogik)]]<br />
[[Category: Diskrete Mathematik I (BZG1155pa) 25/26]]</div>Bfh-sts