Nand: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{Built-in|Nand|⍲}} is a dyadic scalar boolean function which tests if either argument is not true: it returns 0 if both are 1 and 1 if at least...") |
No edit summary |
||
Line 1: | Line 1: | ||
{{Built-in|Nand|⍲}} is a [[dyadic]] [[scalar function|scalar]] [[boolean function]] which tests if either argument is not true: it returns 0 if both are 1 and 1 if at least one is 0. It represents the [[wikipedia:Sheffer stroke|Sheffer stroke]] or alternative denial in Boolean logic. Nand is the [[not|boolean negation]] <source lang=apl inline>~</source> of the [[And]] function <source lang=apl inline>∧</source>. | {{Built-in|Nand|⍲}} is a [[dyadic]] [[scalar function|scalar]] [[boolean function]] which tests if either argument is not true: it returns 0 if both are 1 and 1 if at least one is 0. It represents the [[wikipedia:Sheffer stroke|Sheffer stroke]] or alternative denial in Boolean logic. Nand is the [[not|boolean negation]] <source lang=apl inline>~</source> of the [[And]] function <source lang=apl inline>∧</source>. The [[glyph]] for Nand is composed from those of [[Not]] (<source lang=apl inline>~</source>) and [[And]] (<source lang=apl inline>∧</source>) , but [[fonts]] vary in how they compose them; some overlaying the glyphs (∧̴), and some stacking them (∧̃). | ||
{|class=wikitable | {|class=wikitable |
Revision as of 05:44, 2 June 2020
⍲
|
Nand (⍲
) is a dyadic scalar boolean function which tests if either argument is not true: it returns 0 if both are 1 and 1 if at least one is 0. It represents the Sheffer stroke or alternative denial in Boolean logic. Nand is the boolean negation ~
of the And function ∧
. The glyph for Nand is composed from those of Not (~
) and And (∧
) , but fonts vary in how they compose them; some overlaying the glyphs (∧̴), and some stacking them (∧̃).
⍲ |
0 |
1
|
---|---|---|
0
|
1 |
1
|
1
|
1 |
0
|
Examples
The following shows all possible combinations of inputs as a Boolean function.
0 0 1 1 ⍲ 0 1 0 1 1 1 1 0