pseudo-compactness
Смотреть что такое "pseudo-compactness" в других словарях:
Compactness theorem — In mathematical logic, the compactness theorem states that a set of first order sentences has a model if and only if every finite subset of it has a model. This theorem is an important tool in model theory, as it provides a useful method for… … Wikipedia
Gromov's compactness theorem (topology) — For Gromov s compactness theorem in Riemannian geometry, see that article. In symplectic topology, Gromov s compactness theorem states that a sequence of pseudoholomorphic curves in an almost complex manifold with a uniform energy bound must have … Wikipedia
Elementary class — In the branch of mathematical logic called model theory, an elementary class (or axiomatizable class) is a class consisting of all structures satisfying a fixed first order theory. Contents 1 Definition 2 Conflicting and alternative terminology … Wikipedia
Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… … Wikipedia
List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… … Wikipedia
Metric space — In mathematics, a metric space is a set where a notion of distance (called a metric) between elements of the set is defined. The metric space which most closely corresponds to our intuitive understanding of space is the 3 dimensional Euclidean… … Wikipedia
Pseudocompact space — In mathematics, in the field of topology, a topological space is said to be pseudocompact if its image under any continuous function to R is bounded.Conditions for pseudocompactness*Every countably compact space is pseudocompact. For normal… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic … Wikipedia
General relativity — For a generally accessible and less technical introduction to the topic, see Introduction to general relativity. General relativity Introduction Mathematical formulation Resources … Wikipedia
Ricci curvature — In differential geometry, the Ricci curvature tensor, named after Gregorio Ricci Curbastro, provides one way of measuring the degree to which the geometry determined by a given Riemannian metric might differ from that of ordinary Euclidean n… … Wikipedia
