TOPICS
Search

Search Results for ""


231 - 240 of 1549 for First Order OrdinarySearch Results
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 ...
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 ...
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 ...
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 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 ...
The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...
1 ... 21|22|23|24|25|26|27 ... 155 Previous Next

...