smallest element
31Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… …
32Paris–Harrington theorem — In mathematical logic, the Paris–Harrington theorem states that a certain combinatorial principle in Ramsey theory is true, but not provable in Peano arithmetic. This was the first natural example of a true statement about the integers that could …
33Search data structure — In computer science, a search data structure is any data structure that allows the efficient retrieval of specific items from a set of items, such as a specific record from a database. The simplest, most general, and least efficient search… …
34Infimum — In mathematics the infimum of a subset of some set is the greatest element, not necessarily in the subset, that is less than or equal to all elements of the subset. Consequently the term greatest lower bound (also abbreviated as glb or GLB) is… …
35Order topology — In mathematics, an order topology is a certain topology that can be defined on any totally ordered set. It is a natural generalization of the topology of the real numbers to arbitrary totally ordered sets. If X is a totally ordered set, the order …
36pixel — /pik seuhl, sel/, n. Computers, Television. the smallest element of an image that can be individually processed in a video display system. [1965 70; PIX2 (def. 1) + EL(EMENT)] * * * in full picture element Smallest resolved unit of a video image… …
37Well-ordering principle — In mathematics, the well ordering principle states that every non empty set of positive integers contains a smallest element. [cite book |title=Introduction to Analytic Number Theory |last=Apostol |first=Tom |authorlink=Tom M. Apostol |year=1976… …
38complemented — /kom pleuh men tid/, adj. 1. having a complement or complements. 2. Math. (of a lattice containing a smallest element and a greatest element) having the property that corresponding to each element of the lattice is a second element such that the… …
39complemented — past of complement * * * /kom pleuh men tid/, adj. 1. having a complement or complements. 2. Math. (of a lattice containing a smallest element and a greatest element) having the property that corresponding to each element of the lattice is a… …
40Knaster–Tarski theorem — In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following:: Let L be a complete lattice and let f : L → L be an order preserving function. Then the set …
