TOPICS
Search

Search Results for ""


251 - 260 of 13134 for Naive set theorySearch Results
One of the Zermelo-Fraenkel axioms which asserts the existence for any set a of a set x such that, for any y of a, if there exists a z satisfying A(y,z), then such z exists ...
A relation R on a set S is transitive provided that for all x, y and z in S such that xRy and yRz, we also have xRz.
A proper subset S^' of a set S, denoted S^' subset S, is a subset that is strictly contained in S and so necessarily excludes at least one member of S. The empty set is ...
The cardinal number of any set is lower than the cardinal number of the set of all its subsets. A corollary is that there is no highest aleph (aleph).
The fractal J(-3/4,0), where J is the Julia set. It slightly resembles the Mandelbrot set.
A Julia set with c=-0.390541-0.586788i. The fractal somewhat resembles the better known Mandelbrot set.
A set R of linear extensions of a partially ordered set P=(X,<=) is a realizer of P (and is said to realize P) provided that for all x,y in X, x<=y iff x is below y in every ...
A logical system which possesses an explicitly stated set of axioms from which theorems can be derived.
Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...
A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...
1 ... 23|24|25|26|27|28|29 ... 1314 Previous Next

...