# ordering

81

**Serializability**— In concurrency control of databases,[1][2] transaction processing (transaction management), and various transactional applications (e.g., transactional memory[3] and software transactional memory), both centralized and distributed, a transaction… …82

**Global serializability**— In concurrency control of databases, transaction processing (transaction management), and other transactional distributed applications, Global serializability (or Modular serializability) is a property of a global schedule of transactions. A… …83

**Actor model theory**— In theoretical computer science, Actor model theory concerns theoretical issues for the Actor model.Actors are the primitives that form the basis of the Actor model of concurrent digital computation. In response to a message that it receives, an… …84

**Monomial order**— In mathematics, a monomial order is a total order on the set of all (monic) monomials in a given polynomial ring, satisfying the following two properties: If u < v and w is any other monomial, then uw<vw. In other words, the ordering… …85

**Belief revision**— is the process of changing beliefs to take into account a new piece of information. The logical formalization of belief revision is researched in philosophy, in databases, and in artificial intelligence for the design of rational agents.What… …86

**Concurrency control**— In information technology and computer science, especially in the fields of computer programming (see also concurrent programming, parallel programming), operating systems (see also parallel computing), multiprocessors, and databases, concurrency …87

**Normal order**— For other uses, see Normal order (disambiguation). In quantum field theory a product of quantum fields, or equivalently their creation and annihilation operators, is usually said to be normal ordered (also called Wick order) when all creation… …88

**Social Choice and Individual Values**— Kenneth Arrow s monograph Social Choice and Individual Values (1951, 2nd ed., 1963) and a theorem within it created modern social choice theory, a rigorous melding of social ethics and voting theory with an economic flavor. Somewhat formally, the …89

**Well-order**— In mathematics, a well order relation (or well ordering) on a set S is a total order on S with the property that every non empty subset of S has a least element in this ordering.Equivalently, a well ordering is a well founded total order.The set… …90

**Degeneracy (graph theory)**— In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… …