- semi-lattice
- полуструктура, псевдоструктура
Большой англо-русский и русско-английский словарь. 2001.
semi-lattice
Смотреть что такое "semi-lattice" в других словарях:
Lattice Semiconductor — 45° 31′ 38″ N 122° 55′ 36″ W / 45.52721, 122.92662 … Wikipédia en Français
E₈ lattice — In mathematics, the E8 lattice is a special lattice in R8. It can be characterized as the unique positive definite, even, unimodular lattice of rank 8. The name derives from the fact that it is the root lattice of the E8 root system. The normIn… … Wikipedia
Modular lattice — Hasse diagram of N5, the smallest non modular lattice. In the branch of mathematics called order theory, a modular lattice is a lattice that satisfies the following self dual condition: Modular law x ≤ b implies… … Wikipedia
Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… … Wikipedia
Semimodular lattice — This article is about generalizations of modularity in terms of the atomic covering relation. For M symmetry, the generalization of modularity in terms of modular pairs, see modular lattice. The centred hexagon lattice S7, also known as D2, is… … Wikipedia
Map of lattices — The concept of a lattice arises in order theory, a branch of mathematics. The Hasse diagram below depicts the inclusion relationships among some important subclasses of lattices. Proofs of the relationships in the map 1. A boolean algebra is a… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Finite set — In mathematics, a set is called finite if there is a bijection between the set and some set of the form {1, 2, ..., n} where n is a natural number. (The value n = 0 is allowed; that is, the empty set is finite.) An infinite set is a set which is… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Arrangement of hyperplanes — In geometry and combinatorics, an arrangement of hyperplanes is a finite set A of hyperplanes in a linear, affine, or projective space S . Questions about a hyperplane arrangement A generally concern geometrical, topological, or other properties… … Wikipedia
Turing degree — Post s problem redirects here. For the other Post s problem , see Post s correspondence problem. In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic … Wikipedia
