Related papers: The Thins Ordering on Relations

The Axiom-Based Atlas is a novel framework that structurally represents mathematical theorems as proof vectors over foundational axiom systems. By mapping the logical dependencies of theorems onto vectors indexed by axioms - such as those…

We study several fairness notions in allocating indivisible chores (i.e., items with non-positive values) to agents who have additive and submodular cost functions. The fairness criteria we are concern with are envy-free up to any item…

Let $R$ be a not necessarily commutative ring with $1.$ In the present paper we first introduce a notion of quasi-orderings, which axiomatically subsumes all the orderings and valuations on $R$. We proceed by uniformly defining a coarsening…

In theories of communication, it is usually presumed that the involved parties perform actions in a fixed causal order. However, practical and fundamental reasons can induce uncertainties in the causal order. Here we show that a maximal…

A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…

We study the fundamental problem of allocating indivisible goods to agents with additive preferences. We consider eliciting from each agent only a ranking of her $k$ most preferred goods instead of her full cardinal valuations. We…

Starting with the Brezis-Browder principle, we give stronger versions of many variational principles and minimal element theorems which appeared in the recent literature. Relationships among the elements of different sets of assumptions are…

In practice, a ranking of objects with respect to given set of criteria is of considerable importance. However, due to lack of knowledge, information of time pressure, decision makers might not be able to provide a (crisp) ranking of…

The theory of small cancellation groups is well known. In this paper we introduce the notion of Group-like Small Cancellation Ring. This is the main result of the paper. We define this ring axiomatically, by generators and defining…

We study the setting of committee elections, where a group of individuals needs to collectively select a given size subset of available objects. This model is relevant for a number of real-life scenarios including political elections,…

An approximate divisor order is a partial order on the positive integers $\mathbb{N}^+$ that refines the divisor order and is refined by the additive total order. A previous paper studied such a partial order on $\mathbb{N}^+$, produced…

The aim of this article is to define a notion of cardinal utility function called measurable utility and to define it on a connected and separable subset of a weakly ordered topological space. The definition is equivalent to the ones given…

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

Data collection often involves the partial measurement of a larger system. A common example arises in collecting network data: we often obtain network datasets by recording all of the interactions among a small set of core nodes, so that we…

Let $X$ be an ordered vector space. The net $\{x_\alpha\}\subseteq X$ is semi unbounded order convergent to $x$ (in symbol $x_\alpha\xrightarrow{suo}x$), if there is a net $\{y_\beta\}$, possibly over a different index set, such that…

We offer streamlined proofs of fundamental theorems regarding the index theory for partial self-maps of an infinite set that are bijective between cofinite subsets.

In many domains it is desirable to assess the preferences of users in a qualitative rather than quantitative way. Such representations of qualitative preference orderings form an importnat component of automated decision tools. We propose a…

The minimization principle $\textsf{MIN}(\triangleleft)$ studied in bounded arithmetic says that a strict linear ordering $\triangleleft$ on any finite interval $[0,\dots,n)$ has the minimal element. We shall prove that bounded arithmetic…

This paper proposes decoupling the dependency tree from word order, such that surface ordering is not determined by traversing the dependency tree. We develop the notion of a \emph{word order domain structure}, which is linked but…