Search Results for ""

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). ...

A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...

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 ...

Consider a power series in a complex variable z g(z)=sum_(n=0)^inftya_nz^n (1) that is convergent within the open disk D:|z|<R. Convergence is limited to within D by the ...

A type of mathematical result which is considered by most logicians as more natural than the metamathematical incompleteness results first discovered by Gödel. Finite ...

The decimal expansion of the natural logarithm of 10 is given by ln10=2.302585092994045684... (1) (OEIS A002392). It is also given by the BBP-type formulas ln10 = (2) = ...

Let |z| be a vector norm of a vector z such that ||A||=max_(|z|=1)||Az||. Then ||A|| is a matrix norm which is said to be the natural norm induced (or subordinate) to the ...