Nand: Difference between revisions

From APL Wiki
Jump to navigation Jump to search
mNo edit summary
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>. 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 (∧&#x334;), and some stacking them (∧&#x303;).
{{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>, and so its [[glyph]] is composed from those. However, [[fonts]] vary in how they compose them; some overlaying the glyphs (∧&#x334;), and some stacking them (∧&#x303;).


{|class=wikitable
{|class=wikitable

Revision as of 05:49, 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 , and so its glyph is composed from those. However, 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

External links

Documentation

APL built-ins [edit]
Primitives (Timeline) Functions
Scalar
Monadic ConjugateNegateSignumReciprocalMagnitudeExponentialNatural LogarithmFloorCeilingFactorialNotPi TimesRollTypeImaginarySquare RootRound
Dyadic AddSubtractTimesDivideResiduePowerLogarithmMinimumMaximumBinomialComparison functionsBoolean functions (And, Or, Nand, Nor) ∙ GCDLCMCircularComplexRoot
Non-Scalar
Structural ShapeReshapeTallyDepthRavelEnlistTableCatenateReverseRotateTransposeRazeMixSplitEncloseNestCut (K)PairLinkPartitioned EnclosePartition
Selection FirstPickTakeDropUniqueIdentityStopSelectReplicateExpandSet functions (IntersectionUnionWithout) ∙ Bracket indexingIndexCartesian ProductSort
Selector Index generatorGradeIndex OfInterval IndexIndicesDealPrefix and suffix vectors
Computational MatchNot MatchMembershipFindNub SieveEncodeDecodeMatrix InverseMatrix DivideFormatExecuteMaterialiseRange
Operators Monadic EachCommuteConstantReplicateExpandReduceWindowed ReduceScanOuter ProductKeyI-BeamSpawnFunction axisIdentity (Null, Ident)
Dyadic BindCompositions (Compose, Reverse Compose, Beside, Withe, Atop, Over) ∙ Inner ProductDeterminantPowerAtUnderRankDepthVariantStencilCutDirect definition (operator)Identity (Lev, Dex)
Quad names Index originComparison toleranceMigration levelAtomic vector