The paper considers a generalization of the standard completion of a partially ordered set through the collection of all its lower sets.

This paper introduces and begins the study of a well-behaved class of linearly ordered structures, the ^-minimal structures. The definition of this class and the corresponding class of theories, the strongly ©-minimal theories, is made in analogy with the notions from stability theory of minimal structures and strongly minimal theories. Theorems 2.1 and 2.3, respectively, provide characterizati...

We define the (n, i, f)-tube orders, which include interval orders, trapezoid orders, triangle orders, weak orders, order dimension n, and interval-orderdimension n as special cases. We investigate some basic properties of (n, i, f)-tube orders, and begin classifying them by containment.

Let   a family of monomorphisms in the category A ‎To study mathematical notions in a category  A‎, ‎such as injectivity‎, ‎tensor products‎, ‎flatness‎, ‎with respect to a class M of its (mono)morphisms‎, ‎one should know some of the categorical properties of the pair (A ‎,M ‎)‎. ‎In this paper we take A to be the‎‎category  Pos-S  of S-partially ordered sets  and   to be a particular‎ class o...

Let be a partial order on a countable set V such that there exists a minimum element a ∈ V and {u ∈ V : u v} is finite for each v ∈ V . An item of information is to be broadcast to the elements of V according to the policy in the following sense: a is initially informed and broadcasting to v 6= a begins as soon as all elements u ≺ v are informed; the time required to broadcast the information i...

We consider the problem of determining finite integer sets which are knapsack-solvable in linear time (that is, it is possible to determine in linear time, for any integer b, whether b can be expressed as a sum of distinct elements of that set) and where the largest element is as small as possible. We study the condition that the k-subsets (for fixed k) when lexicographically ordered have incre...