Search Results for ""

Let (A,<=) and (B,<=) be totally ordered sets. Let C=A×B be the Cartesian product and define order as follows. For any a_1,a_2 in A and b_1,b_2 in B, 1. If a_1<a_2, then ...

Let theta be an irrational number, define S(theta)={c+dtheta:c,d in N}, and let c_n(theta)+thetad_n(theta) be the sequence obtained by arranging the elements of S(theta) in ...

In particle physics, a spinor field of order 2s describes a particle of spin s, where s is an integer or half-integer. Therefore, a spinor of order 4s contains as much ...

The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...

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 Paris-Harrington theorem is a strengthening of the finite Ramsey's theorem by requiring that the homogeneous set be large enough so that cardH>=minH. Clearly, the ...

A method of numerically integrating ordinary differential equations by using a trial step at the midpoint of an interval to cancel out lower-order error terms. The ...

This theorem states that, for a partial differential equation involving a time derivative of order n, the solution is uniquely determined if time derivatives up to order n-1 ...

A linear ordinary differential equation of order n is said to be homogeneous if it is of the form a_n(x)y^((n))+a_(n-1)(x)y^((n-1))+...+a_1(x)y^'+a_0(x)y=0, (1) where ...

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