-
1 неразложимый в объединение
join irreducible мат., join-irreducibleРусско-английский научно-технический словарь Масловского > неразложимый в объединение
-
2 объединение
* * *n. union, join, sum, combination, unification; association;
гомоморфизм по объединению - jom-homomorphism;
гомоморфный по объединениям - join-homomorphic;
неразложимый в объединение - join-irreducible -
3 объединение
n. union, join, sum, combination, unification; association; гомоморфизм по объединению, jom-homomorphism; гомоморфный по объединениям, join-homomorphic; неразложимый в объединение, join-irreducibleРусско-английский словарь математических терминов > объединение
-
4 объединение
n.union, join, sum, combination, unification; association -
5 неразложимый в объединение
<math.> join-irreducibleРусско-английский технический словарь > неразложимый в объединение
-
6 неразложимое в объединение многообразие
Mathematics: join-irreducible varietyУниверсальный русско-английский словарь > неразложимое в объединение многообразие
-
7 неразложимый в объединение
Mathematics: join irreducibleУниверсальный русско-английский словарь > неразложимый в объединение
-
8 неразложимый в объединение элемент
Mathematics: join-irreducible elementУниверсальный русско-английский словарь > неразложимый в объединение элемент
См. также в других словарях:
Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… … Wikipedia
Distributive lattice — In mathematics, distributive lattices are lattices for which the operations of join and meet distribute over each other. The prototypical examples of such structures are collections of sets for which the lattice operations can be given by set… … Wikipedia
Distributive lattice/Proofs — Lemma 1Every totally ordered set is a distributive lattice with max as join and min as meet.ProofWe will show: : x vee (y wedge z) = (x vee y)wedge(x vee z)We may suppose yle z (If not, zle y and we may switch y and z.) Recall that yle z is… … Wikipedia
Stone duality — In mathematics, there is an ample supply of categorical dualities between certain categories of topological spaces and categories of partially ordered sets. Today, these dualities are usually collected under the label Stone duality, since they… … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Relational model — The relational model for database management is a database model based on first order predicate logic, first formulated and proposed in 1969 by Edgar Codd. [ Derivability, Redundancy, and Consistency of Relations Stored in Large Data Banks , E.F … Wikipedia
Orbifold — This terminology should not be blamed on me. It was obtained by a democratic process in my course of 1976 77. An orbifold is something with many folds; unfortunately, the word “manifold” already has a different definition. I tried “foldamani”,… … Wikipedia
Michael Polanyi — In England, 1933 Born Polányi Mihály March 11, 1891(1891 03 11) Budapest, Austria Hungary … Wikipedia
Square root of 2 — The square root of 2, also known as Pythagoras constant, often denoted by:sqrt{2} or √2but can also be written as:2^{1/2},,is the positive real number that, when multiplied by itself, gives the number 2. Its numerical value approximated to 65… … Wikipedia
Retículo (orden) — Diagrama de Hasse del retículo de particiones del conjunto {1,2,3,4}. En matemática, un retículo es una determinada estructura algebraica con dos operaciones binarias, o bien un conjunto parcialmente ordenado con ciertas propiedades específicas… … Wikipedia Español
PHILOSOPHY, JEWISH — This article is arranged according to the following outline: WHAT IS JEWISH PHILOSOPHY? recent histories of jewish philosophy biblical and rabbinic antecedents bible rabbinic literature hellenistic jewish philosophy philo of alexandria biblical… … Encyclopedia of Judaism
