Related papers: Branching Bisimilarity with Explicit Divergence

Motivated by the Poisson Dixmier-Moeglin equivalence problem, a systematic study of commutative unitary rings equipped with a {\em biderivation}, namely a binary operation that is a derivation in each argument, is here begun, with an eye…

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…

For an infinite chain bicomplex we show that the orthogonality and grading conditions provide it with the structure of a bigraded differential algebra with respect to a natural multiplication of several elements bicomplex spaces.…

We consider isomorphism of controllable graphs and cospectrality of distance-regularized graphs (which are known to be distance-regular or distance-biregular) in relation to logical definability. While most characterizations of these…

Relating formal grammars is a hard problem that balances between language equivalence (which is known to be undecidable) and grammar identity (which is trivial). In this paper, we investigate several milestones between those two extremes…

Evidential reasoning is cast as the problem of simplifying the evidence-hypothesis relation and constructing combination formulas that possess certain testable properties. Important classes of evidence as identifiers, annihilators, and…

Principles of analogical reasoning have recently been applied in the context of machine learning, for example to develop new methods for classification and preference learning. In this paper, we argue that, while analogical reasoning is…

In this paper we introduce the definition of marked permutations. We first present a bijection between Stirling permutations and marked permutations. We then present an involution on Stirling derangements. Furthermore, we present a…

I argue that, on a judicious reading of two existing criteria--one syntactic and the other semantic--dual theories can be taken to be empirically equivalent. The judicious reading is straightforward, but leads to the surprising conclusion…

We prove equivariant versions of the Beilinson-Lichtenbaum conjecture for Bredon motivic cohomology of smooth complex and real varieties with an action of the group of order two. This identifies equivariant motivic and topological…

In this note we discuss a variant of linear logic with idempotent exponential modalities. We propose a sequent calculus system and discuss its semantics. We also give a concrete relational model for this calculus.

We consider the Ext-analogues of branching laws of representations for a group to its subgroups in the context of $p$-adic groups.

Reversible systems exhibit both forward computations and backward computations, where the aim of the latter is to undo the effects of the former. Such systems can be compared via forward-reverse bisimilarity as well as its two components,…

It is known that if A and B are two n-by-n complex matrices and (A,A^T) is simultaneously equivalent to (B,B^T), then A is congruent to B. We extend this statement to multilinear forms.

A variant of the standard notion of branching bisimilarity for processes with discrete relative timing is proposed which is coarser than the standard notion. Using a version of ACP (Algebra of Communicating Processes) with abstraction for…

We prove that a biseparating map between spaces B(E), and some other Banach algebras, is automatically continuous and an algebra isomorphism.

Recognizing that even correct translations are not always semantically equivalent, we automatically detect meaning divergences in parallel sentence pairs with a deep neural model of bilingual semantic similarity which can be trained for any…

We introduce a notion of equivalence on tilings which is formulated in terms of their local structure. We compare it with the known concept of locally deriving one tiling from another and show that two tilings of finite type are…

A decidability proof for bisimulation equivalence of first-order grammars (finite sets of labelled rules for rewriting roots of first-order terms) is presented. The equivalence generalizes the DPDA (deterministic pushdown automata)…

It is shown that a natural notion of congruence permutability for quasivarieties already implies ``being a variety''. The result follows immediately from [3] and the sole aim of this note is to state it explicitly, together with a…