One of the most basic measures of the complexity of a given partially ordered structure is the quantity of partial orderings embeddable in this structure. In the structure of the Turing degrees, DT , this problem is investigated in a series of results: Mostowski [15] proves that there is a computable partial ordering in which every countable partial ordering can be embedded. Kleene and Post [10...

The notion of information systems provides a convenient tool for knowledge representation of objects in terms of their attribute values, while partial ordering is usually used to research the rough monotonicity of an uncertainty measure in information systems. In this paper, we first reveal the limitations of existing partial orderings to describe information granulations in information systems...

In this paper we present a partial ordering semantics for the-calculus. The model we adopt is transition system based. In spite of their inter-leaving nature, we show that it is possible to completely abstract from the generation ordering of transitions. The deenition of this semantics drive us in deening a standard SOS semantics that directly yields the partial ordering semantics of-calculus.

This RFC introduces a new transport mechanism for TCP based upon partial ordering. The aim is to present the concepts of partial ordering and promote discussions on its usefulness in network communications. Distribution of this memo is unlimited.

In this paper, we first show that Renyi distance between any member of a parametric family and its perturbations, is proportional to its Fisher information. We, then, prove some relations between the Renyi distance of two distributions and the Fisher information of their exponentially twisted family of densities. Finally, we show that the partial ordering of families induced by Renyi dis...

We study the complexity of infinite chains and antichains in computable partial orderings. We show that there is a computable partial ordering which has an infinite chain but none that is Σ1 or Π 1 1, and also obtain the analogous result for antichains. On the other hand, we show that every computable partial ordering which has an infinite chain must have an infinite chain that is the differenc...