Search Results for ""

The rule (F,F=>G)/G, where => means "implies," which is the sole rule of inference in propositional calculus. This rule states that if each of F and F=>G is either an axiom ...

Let B dollars be borrowed at an interest rate of i per month, where i is the annual rate divided by 12, and assume the mortgage needs to be paid back in n months. Then the ...

Let A be a set. An operation on A is a function from a power of A into A. More precisely, given an ordinal number alpha, a function from A^alpha into A is an alpha-ary ...

A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.

A formula of first-order logic is said to be in Skolemized form (sometimes also called Skolem standard form or universal form) if it is of the form forall x_1... forall x_nM, ...

A relation < is a strict order on a set S if it is 1. Irreflexive: a<a does not hold for any a in S. 2. Asymmetric: if a<b, then b<a does not hold. 3. Transitive: a<b and b<c ...

Let P=(P,<=) be a partially ordered set, and let x,y,z in P. If x<=y<=z, then y is said to be between x and z. If y is between x and z and y not in {x,z}, then y is strictly ...

In nonstandard analysis, the transfer principle is the technical form of the following intuitive idea: "Anything provable about a given superstructure V by passing to a ...

In set theory, a unary operation on set A is a function A->A. More generally, a unary operation is a function with exactly one operand, such as the factorial, square root, or ...

A uniquely complemented lattice is a complemented lattice (L, ^ , v ,0,1,^') that satisfies ( forall x in L)( forall y in L)[(x ^ y=0) ^ (x v y=1)]=>y=x^'. The class of ...