Search Results for ""

A sentential variable, also called a propositional variable, that can be substituted for in arbitrary sentential formulas (Carnap 1958, p. 24).

A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be ...

A morphism f:X->Y is said to be separable if K(X) is a separable extension of K(Y).

A polynomial with coefficients in a field is separable if its factors have distinct roots in some extension field.

A topological space having a countable dense subset. An example is the Euclidean space R^n with the Euclidean topology, since it has the rational lattice Q^n as a countable ...

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

Two distinct point pairs AC and BD separate each other if A, B, C, and D lie on a circle (or line) in such order that either of the arcs (or the line segment AC) contains one ...

An algebraic surface of degree 7. The Labs septic is an example of a septic surface.

Let a sequence {a_i}_(i=1)^infty be strictly increasing and composed of nonnegative integers. Call A(x) the number of terms not exceeding x. Then the density is given by ...

An array B=b_(ij), i,j>=1 of positive integers is called a dispersion if 1. The first column of B is a strictly increasing sequence, and there exists a strictly increasing ...