Related papers: A Note on Invariant Extensions of Preorders
We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation. The finite satisfiability problem for this logic is shown to be decidable, in triply…
We show that if a nontrivial group admits a locally invariant ordering, then it admits uncountably many locally invariant orderings. For the case of a left-orderable group, we provide an explicit construction of uncountable families of…
Local unitary invariants allow one to test whether multipartite states are equivalent up to local basis changes. Equivalently, they specify the geometry of the "orbit space" obtained by factoring out local unitary action from the state…
In our previous work, we proposed the logic obtained from full non-associative Lambek calculus by adding a sort of linear-logical modality. We call this logic non-associative non-commutative intuitionistic linear logic ($\mathbf{NACILL}$,…
We define an annular concordance invariant and study its properties. When specialized to braids, this invariant gives bounds on band rank. We introduce a modified chain complex to reformulate the invariant. Then, by focusing on a special…
We construct a family of hyperbolic link complements by gluing tangles along totally geodesic four-punctured spheres, then investigate the commensurability relation among its members. Those with different volume are incommensurable,…
A rack is a set with a binary operation that is right-invertible and self-distributive, properties diagrammatically corresponding to Reidemeister moves II and III, respectively. A rack is said to be an {\it augmented rack} if the operation…
Pairwise comparisons between alternatives are a well-established tool to decompose decision problems into smaller and more easily tractable sub-problems. However, due to our limited rationality, the subjective preferences expressed by…
Multicriteria decision analysis aims at supporting a person facing a decision problem involving conflicting criteria. We consider an additive utility model which provides robust conclusions based on preferences elicited from the decision…
Consider a cyclically ordered collection of $r$ equinumerous agent sets with strict preferences of every agent over the agents from the next agent set. A weakly stable cyclic matching is a partition of the set of agents into disjoint union…
A structure called a decision making problem is considered. The set of outcomes (consequences) is partially ordered according to the decision maker's preferences. The problem is how these preferences affect a decision maker to prefer one of…
A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…
All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…
The projective special linear group $\PSL_2(n)$ is $2$-transitive for all primes $n$ and $3$-homogeneous for $n \equiv 3 \pmod{4}$ on the set $\{0,1, \cdots, n-1, \infty\}$. It is known that the extended odd-like quadratic residue codes are…
We consider mappings that distort the modulus of families of paths in the opposite direction in the manner of Poletsky's inequality. Here we study the case when the mappings are not closed, in particular, they do not preserve the boundary…
A long-standing question is what invariant sets can be shared by two maps acting on the same space. A similar question stands for invariant measures. A particular interesting case are expanding Markov maps of the circle. If the two involved…
One may ask whether an extended group of invariance can naturally be attributed to the space of associative commutative Quadrahyperbolic Numbers? To search for a rigorous and positive answer to the question, we shall focus on the method of…
It is shown that the finite satisfiability problem for two-variable logic over structures with one total preorder relation, its induced successor relation, one linear order relation and some further unary relations is EXPSPACE-complete.…
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…
A successor-invariant first-order formula is a formula that has access to an auxiliary successor relation on a structure's universe, but the model relation is independent of the particular interpretation of this relation. It is well known…