Bfh-sts: Created page with "= Sheffer stroke = The Sheffer stroke (also called ''NAND'') is a logical operation that returns true unless both propositions are true. It is functionally complete, meaning all other logical operations can be built from it. == Symbols == * p ↑ q (mathematical notation) * p NAND q (common name) * NOT (p ∧ q) (definition) == Definition == The Sheffer stroke produces the negation of conjunction. == Truth Table == {| class="wikitab..."

2025-10-20T13:28:51Z

Created page with "= Sheffer stroke = The Sheffer stroke (also called ''NAND'') is a logical operation that returns true unless both propositions are true. It is functionally complete, meaning all other logical operations can be built from it. == Symbols == * p ↑ q (mathematical notation) * p NAND q (common name) * NOT (p ∧ q) (definition) == Definition == The Sheffer stroke produces the negation of conjunction. == Truth Table == {| class="wikitab..."

New page

= Sheffer stroke =

The Sheffer stroke (also called ''NAND'') is a logical operation that returns true unless both propositions are true.
It is functionally complete, meaning all other logical operations can be built from it.

== Symbols ==
* p ↑ q (mathematical notation)
* p NAND q (common name)
* NOT (p ∧ q) (definition)

== Definition ==
The Sheffer stroke produces the [[Negation | negation]] of [[Conjunction | conjunction]].

== Truth Table ==
{| class="wikitable"
! p !! q !! p ↑ q
|-
| T || T || F
|-
| T || F || T
|-
| F || T || T
|-
| F || F || T
|}

== Examples ==
* If ''p'' = "The switch is on" and ''q'' = "The light is on",
then ''p ↑ q'' = "It is not the case that the switch and the light are both on".
* In digital logic, NAND gates are fundamental building blocks for circuits.
* In Python: <code>not (p and q)</code>
* In Java: <code>!(p && q)</code>

[[Category:Propositional logic (Aussagenlogik)]]
[[Category: Diskrete Mathematik I (BZG1155pa) 25/26]]

Sheffer stroke - Revision history