Search Results for ""

A predicate in logic equivalent to the composition NOT OR that yields false if any condition is true, and true if all conditions are false. A NOR B is equivalent to !(A v B), ...

An connective in logic which converts true to false and false to true. NOT A is denoted !A, ¬A, A^_ (Simpson 1987, p. 537) or ∼A (Carnap 1958, p. 7; Mendelson 1997, p. 12). ...

NAND, also known as the Sheffer stroke, is a connective in logic equivalent to the composition NOT AND that yields true if any condition is false, and false if all conditions ...

The Narayan number N(n,k) for n=1, 2, ... and k=1, ..., n gives a solution to several counting problems in combinatorics. For example, N(n,k) gives the number of expressions ...

Polynomials s_k(x;a) which form the Sheffer sequence for g(t) = ((e^t-1)/t)^(-a) (1) f(t) = e^t-1 (2) which have generating function ...

The term Nasik cube can refer to a number of different sorts of magic cubes. In particular, a Nasik cube is a magic cube in which additionally 1. The broken space diagonals ...

Let F,G:C->D be functors between categories C and D. A natural transformation Phi from F to G consists of a family Phi_C:F(C)->G(C) of morphisms in D which are indexed by the ...

Let C be an error-correcting code consisting of N codewords in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...

The Nechushtan graph, illustrated above, is a 10-vertex 5-chromatic graph that is unit-distance in 3 dimensions. It was used by Nechushtan (2002) in the construction of of a ...

The neighborhood complex N(G) of a locally finite graph G is defined as the abstract simplicial complex formed by the subsets of the neighborhoods of all vertices of G.