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

Let a spherical triangle have sides a, b, and c with A, B, and C the corresponding opposite angles. Then (sin[1/2(A-B)])/(sin[1/2(A+B)]) = (tan[1/2(a-b)])/(tan(1/2c)) (1) ...

The Napoleon-Feuerbach cubic is the pivotal isogonal cubic with nine-point center N as the pivot point. It therefore has trilinear equation ...

The first Napoleon point N is the concurrence of lines drawn between vertices of a given triangle DeltaABC and the opposite vertices of the corresponding inner Napoleon ...

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

A Nash equilibrium of a strategic game is a profile of strategies (s_1^*,...,s_n^*), where s_i^* in S_i (S_i is the strategy set of player i), such that for each player i, ...

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 catacaustic of the natural logarithm lnx specified parametrically as x = t (1) y = lnt (2) is a complicated expression for an arbitrary radiant point. However, for a ...