** Well-ordering theorem: Every set can be well-ordered.

** Tarski's theorem: For every infinite set A, there is a bijective map between the sets A and A × A.

** Zorn's lemma: Every non-empty partially ordered set in which every chain ( i. e. totally ordered subset ) has an upper bound contains at least one maximal element.

** Hausdorff maximal principle: In any partially ordered set, every totally ordered subset is contained in a maximal totally ordered subset.

** Antichain principle: Every partially ordered set has a maximal antichain.

** For every non-empty set S there is a binary operation defined on S that makes it a group.

** If S is a set of sentences of first-order logic and B is a consistent subset of S, then B is included in a set that is maximal among consistent subsets of S. The special case where S is the set of all first-order sentences in a given signature is weaker, equivalent to the Boolean prime ideal theorem ; see the section " Weaker forms " below.

** If the set A is infinite, then there exists an injection from the natural numbers N to A ( see Dedekind infinite ).

** Gödel's completeness theorem for first-order logic: every consistent set of first-order sentences has a completion.

** In particular, the cofinality of any nonzero finite ordinal, or indeed any finite directed set, is 1, since such sets have a greatest element.

** In particular, let A be a set of size n, and consider the set of subsets of A containing no more than m elements.

** Mine Exploder T11: Six forward firing mortars to set off mines.

** " Has the same absolute value " on the set of real numbers

** " Has the same cosine " on the set of all angles.

** Filter ( mathematics ), a special subset of a partially ordered set

** The set of infinite strings is the inverse limit of the set of finite strings, and is thus endowed with the limit topology.

** Written communication ( writing ) – representation of language in a textual medium through the use of a set of signs or symbols ( known as a writing system ).

** Mouthpiece ( scuba ), a component of a scuba diving or industrial breathing set

** Metrics ( networking ), set of properties of a communication path

** Also an older term for the empty set

** 4 8 × 8 single-color user-defined sprites ; each sprite's color may be set independently

** X register and Y register-They are number stores where numbers are stored temporarily while doing calculations.

** writing to or reading from a device control register

** data register, e. g. " D0 "

** address register, e. g. " A6 "

** Indexed register indirect with 8-bit signed offset e. g. 8 ( A0, D0 ) or 8 ( A0, A1 )

** 24-bit shift register, clockable at 2 frequencies

** Two separate register files, which could be quickly switched, to speed up response to interrupts

** move data from a memory location to a register, or vice versa.

** add, subtract, multiply, or divide the values of two registers, placing the result in a register, possibly setting one or more condition codes in a status register

** perform bitwise operations, taking the conjunction and disjunction of corresponding bits in a pair of registers, or the negation of each bit in a register

** The early MMX instruction set shared a register file with the floating-point stack, which caused inefficiencies when mixing floating-point and MMX code.

** to store the registers and parts of the state-machines used in some microprocessors ( see register file )

** Ted Hoff and Stan Mazor and Larry Potter ( IBM Chief Scientist of IBM ) proposed a single-chip implementation of the CTC architecture, using RAM register memory rather than shift register memory, and also added a few instructions and interrupt facility.

** Administering and maintaining the register of England's listed buildings, scheduled monuments, registered battlefields, conservation areas and protected parks and gardens.

** A vertical scroll register

** Vertical and horizontal display offset register

** a horizontal scroll register

** The organization Citizens for Civil Discourse has lobbied Congress to close this loophole by developing a National Political Do Not Call Registry where voters can register their phone numbers and ask politicians to take the " Do Not Contact Pledge ".

** Compute the effective address when the base register is available, and place it in the load / store buffer

** Some processors contain registers that may only be used to hold an address or only to hold numeric values ( in some cases used as an index register whose value is added as an offset from some address ); others allow registers to hold either kind of quantity.

** Memory buffer register

** Memory data register