Related papers: On Generalized Ordered Sets: A constructive develo…
We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order…
It is known that the set of all nonnegative integers may be equipped with a total order that is chaotic in the sense that there is no monotone three-term arithmetic progressions. Such chaotic order must be so complicated that the resulting…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
Weak structures abound in higher category theory, but are often suitably equivalent to stricter structures that are easier to understand. We extend strictification for tricategories and trihomomorphisms to trinatural transformations,…
A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…
We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data…
This work discusses an approach to solving geometric construction problems in which the given figure is included in a set ordered by construction steps. The flow of information is carried through the chain, allowing the original problem to…
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and…
We consider a very weak chain condition for a poset, that is the absence of subsets which are order isomorphic to the set of real numbers in their natural ordering; we study generalised radical groups in which this finiteness condition is…
We find that second order quantification is problematic when a quantified concept variable is supposed to function predicatively. This issue is analyzed and it is shown that a constructive interpretation of the falling under relation…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
The aim of the present paper is to investigate the half-spaces in the convexity structure of all quasiorders on a given set and to use them in an alternative approach to classical order dimension. The main result states that linear orders…
Weak values are usually associated with weak measurements of an observable on a pre- and post-selected ensemble. We show that more generally, weak values are proportional to the correlation between two pointers in a successive measurement.…
Tensors and traceouts are generalised, so that systems can be partitioned according to almost arbitrary logical predicates. One might have feared that the familiar interrelations between the notions of unitarity, complete positivity,…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…
This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…
In this paper, we give some generalizations the concept of element order and we study some of the properties of these generalized order. In particular, with using this generalization we derive two solvability criteria.
We construct the complete set of orders of growth and we define on it the generalized entropy of a dynamical systems. With this object we provide a framework where we can study the separation of orbits of a map beyond the scope of…
The paper presents geometric models for the set WO of weak orders on a finite set. In particulary, WO is modeled as a set of vertices of a cubical subdivision of a permutahedron. This approach is an alternative to the usual representation…