Search Results for ""

A sentential formula that contains at least one free variable (Carnap 1958, p. 24). A sentential variable containing no free variables (i.e., all variables are bound) is ...

Let S be a subset of a metric space. Then the set S is open if every point in S has a neighborhood lying in the set. An open set of radius r and center x_0 is the set of all ...

An operator A:f^((n))(I)|->f(I) assigns to every function f in f^((n))(I) a function A(f) in f(I). It is therefore a mapping between two function spaces. If the range is on ...

Let T be a linear operator on a separable Hilbert space. The spectrum sigma(T) of T is the set of lambda such that (T-lambdaI) is not invertible on all of the Hilbert space, ...

A branch of mathematics which encompasses many diverse areas of minimization and optimization. Optimization theory is the more modern term for operations research. ...

Two totally ordered sets (A,<=) and (B,<=) are order isomorphic iff there is a bijection f from A to B such that for all a_1,a_2 in A, a_1<=a_2 iff f(a_1)<=f(a_2) (Ciesielski ...

An ordered pair representation is a representation of a directed graph in which edges are specified as ordered pairs or vertex indices. The ordered pairs representation of a ...

Let (A,<=) and (B,<=) be disjoint totally ordered sets with order types alpha and beta. Then the ordinal sum is defined at set (C=A union B,<=) where, if c_1 and c_2 are both ...

Let alpha and beta be any ordinal numbers, then ordinal exponentiation is defined so that if beta=0 then alpha^beta=1. If beta is not a limit ordinal, then choose gamma such ...

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