Search Results for ""

A logical structure which does not assume the law of the excluded middle. Three truth values are possible: true, false, or undecided. There are 3072 such logics.

A strategy for the iterated prisoner's dilemma in which a prisoner cooperates on the first move, and thereafter copies the previous move of the other prisoner. Any better ...

A simple unlabeled graph whose connectivity is considered purely on the basis of topological equivalence, so that two edges (v_1,v_2) and (v_2,v_3) joined by a node v_2 of ...

A relation on a totally ordered set.

A trail is a walk v_0, e_1, v_1, ..., v_k with no repeated edge. The length of a trail is its number of edges. A u,v-trail is a trail with first vertex u and last vertex v, ...

The engineering terminology for one use of Fourier transforms. By breaking up a wave pulse into its frequency spectrum f_nu=F(nu)e^(2piinut), (1) the entire signal can be ...

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

A graph G is transitive if any three vertices (x,y,z) such that edges (x,y),(y,z) in G imply (x,z) in G. Unlabeled transitive digraphs are called digraph topologies.

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

A mathematical relationship transforming a function f(x) to the form f(x+a).