Related papers: Linearization of analytic order relations

This paper is about equality of proofs in which a binary predicate formalizing properties of equality occurs, besides conjunction and the constant true proposition. The properties of equality in question are those of a preordering relation,…

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…

A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…

In $\mathsf{ZFC}$, if there is a measurable cardinal with infinitely many Woodin cardinals below it, then for every equivalence relation $E \in L(\mathbb{R})$ on $\mathbb{R}$ with all $\mathbf{\Delta}_1^1$ classes and every $\sigma$-ideal…

We devise exact conditions under which a join semilattice with a weak contact relation can be semilattice embedded into a Boolean algebra with an overlap contact relation, equivalently, into a distributive lattice with additive contact…

The paper deals with partial and weak preference relations defined on infinite-dimensional vector spaces and compatible with algebraic operations. By a partial preference we mean an asymmetric and transitive binary relation, while a weak…

We show that a wide class of $W$-(super)algebras, including $W_N^{(N-1)}$, $U(N)$-superconformal as well as $W_N$ nonlinear algebras, can be linearized by embedding them as subalgebras into some {\em linear} (super)conformal algebras with…

We extend the theory of unified correspondence to a very broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as `lattices with operators'. Specifically, we introduce a very…

The literature provides dichotomies involving homomorphisms (like the G 0 dichotomy) or reductions (like the characterization of sets potentially in a Wadge class of Borel sets, which holds on a subset of a product). However, part of the…

We prove a completeness result for Multiplicative Exponential Linear Logic (MELL): we show that the relational model is injective for MELL proof-nets, i.e. the equality between MELL proof-nets in the relational model is exactly axiomatized…

We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing…

Many systems of interest to control engineering can be modeled by linear complementarity problems. We introduce a new notion of equivalence between linear complementarity problems that sets the basis to translate the powerful tools of…

We study the problem of $P$-interpolation, where $P$ is a set of binary predicate symbols, for certain classes of local extensions of a base theory. For computing the $P$-interpolating terms, we use a hierarchic approach: This allows us to…

Mitsch's natural partial order on the semigroup of binary relations is here characterised by equations in the theory of relation algebras. The natural partial order has a complex relationship with the compatible partial order of inclusion,…

Sorting has a natural generalization where the input consists of: (1) a ground set $X$ of size $n$, (2) a partial oracle $O_P$ specifying some fixed partial order $P$ on $X$ and (3) a linear oracle $O_L$ specifying a linear order $L$ that…

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

We show that it is relatively consistent with ZF that the Borel hierarchy on the reals has length $\omega_2$. This implies that $\omega_1$ has countable cofinality, so the axiom of choice fails very badly in our model. A similar argument…

We study classes of Borel subsets of the real line $\mathbb{R}$ such as levels of the Borel hierarchy and the class of sets that are reducible to the set $\mathbb{Q}$ of rationals, endowed with the Wadge quasi-order of reducibility with…

Given a pseudoword over suitable pseudovarieties, we associate to it a labeled linear order determined by the factorizations of the pseudoword. We show that, in the case of the pseudovariety of aperiodic finite semigroups, the pseudoword…

A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For…