Search Results for ""

The proof theories of propositional calculus and first-order logic are often referred to as classical logic. Intuitionistic propositional logic can be described as classical ...

The most general form of Lagrange's group theorem, also known as Lagrange's lemma, states that for a group G, a subgroup H of G, and a subgroup K of H, (G:K)=(G:H)(H:K), ...

A predictor-corrector method for solution of ordinary differential equations. The third-order equations for predictor and corrector are y_(n+1) = ...

The monster group is the highest order sporadic group M. It has group order |M| = (1) = (2) where the divisors are precisely the 15 supersingular primes (Ogg 1980). The ...

In order to recover all Fourier components of a periodic waveform, it is necessary to use a sampling rate nu at least twice the highest waveform frequency. The Nyquist ...

The center of any sphere which has a contact of (at least) first-order with a curve C at a point P lies in the normal plane to C at P. The center of any sphere which has a ...

A multimagic square such that the first, second, third, fourth, and fifth powers of the elements all yield magic squares is known as a pentamagic square. The first known ...

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...

The Prelle-Singer method is a semi-decision procedure for solving nonlinear first-order ordinary differential equations of the form y^'=P(x,y)/Q(x,y), where P and Q are ...

A formula of first-order logic is in prenex normal form if it is of the form Q_1x_1...Q_nx_nM, (1) where each Q_i is a quantifier forall ("for all") or exists ("exists") and ...