TOPICS
Search

Search Results for ""


2291 - 2300 of 3024 for Well Ordered SetSearch Results
Model completion is a term employed when existential closure is successful. The formation of the complex numbers, and the move from affine to projective geometry, are ...
A lattice which satisfies the identity (x ^ y) v (x ^ z)=x ^ (y v (x ^ z)) is said to be modular.
Let M be a sigma-algebra M, and let lambda_1 and lambda_2 be measures on M. If there exists a pair of disjoint sets A and B such that lambda_1 is concentrated on A and ...
A topological space X is pathwise-connected iff for every two points x,y in X, there is a continuous function f from [0,1] to X such that f(0)=x and f(1)=y. Roughly speaking, ...
Let c=(c_1,...,c_n) be a point in C^n, then the open polydisk is defined by S={z:|z_j-c_j|<|z_j^0-c_j|} for j=1, ..., n.
A function f defined on a subset S subset R^n is said to be pseudoconcave if -f is pseudoconvex.
A quadratic recurrence is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a second-degree polynomial in x_k with k<n. For example, x_n=x_(n-1)x_(n-2) ...
For a point y in Y, with f(y)=x, the ramification index of f at y is a positive integer e_y such that there is some open neighborhood U of y so that x has only one preimage ...
A foliation which has no Reeb components is said to be Reebless.
A Reinhardt domain with center c is a domain D in C^n such that whenever D contains z_0, the domain D also contains the closed polydisk.
1 ... 227|228|229|230|231|232|233 ... 303 Previous Next

...