Related papers: Branching Bisimilarity with Explicit Divergence
Given a graph E we define E-algebraic branching systems, show their existence and how they induce representations of the associated Leavitt path algebra. We also give sufficient conditions to guarantee faithfulness of the representations…
The $\pi$-calculus is used as a model for programming languages. Its contexts exhibit arbitrary concurrency, making them very discriminating. This may prevent validating desirable behavioural equivalences in cases when more disciplined…
This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers to the equivalence class of orientations of a graph $G$ those…
Semantics of a sentence is defined with much less ambiguity than semantics of a single word, and we assume that it should be better preserved by translation to another language. If multilingual sentence embeddings intend to represent…
We show how to define biproducts up to isomorphism in an arbitrary category without assuming any enrichment. The resulting notion coincides with the usual definitions whenever all binary biproducts exist or the category is suitably…
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
It is proved that the relation of isomorphism between separable Banach spaces is a complete analytic equivalence relation, i.e., that any analytic equivalence relation Borel reduces to it. Thus, separable Banach spaces up to isomorphism…
Orbifold equivalence is a notion of symmetry that does not rely on group actions. Among other applications, it leads to surprising connections between hitherto unrelated singularities. While the concept can be defined in a very general…
Enabling preserving bisimilarity is a refinement of strong bisimilarity, which preserves safety as well as liveness properties. To define it properly, labelled transition systems needed to be upgraded with a successor relation, capturing…
Given a quandle, we can construct a symmetric quandle called the symmetric double of the quandle. We show that the (co)homology groups of a given quandle are isomorphic to those of its symmetric double. Moreover, quandle coloring numbers…
In this paper, we introduce a corresponding between bipartite graphs with a perfect matching and digraphs, which implicates an equivalent relation between the extendibility of bipartite graphs and the strongly connectivity of digraphs. Such…
This letter introduces a new, substantially simplified version of the branching recurrence operation of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html), and proves its equivalence to the old, "canonical" version.
While explainability is a desirable characteristic of increasingly complex black-box models, modern explanation methods have been shown to be inconsistent and contradictory. The semantics of explanations is not always fully understood - to…
Ambiguity is a natural language phenomenon occurring at different levels of syntax, semantics, and pragmatics. It is widely studied; in Psycholinguistics, for instance, we have a variety of competing studies for the human disambiguation…
Bipartite networks provide an effective resource for representing, characterizing, and modeling several abstract and real-world systems and structures involving binary relations, which include food webs, social interactions, and…
This article presents an equivalent formulation of the implicit complementarity problem. We demonstrate that solution of the equivalent formulation is equivalent to the solution of the implicit complementarity problem. Moreover, we provide…
For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A iff each one is a substitution instance of the other using operations from C. We study the clones for…
A bilateralist take on proof-theoretic semantics can be understood as demanding of a proof system to display not only rules giving the connectives' provability conditions but also their refutability conditions. On such a view, then, a…
Using approximations, we give several characterizations of separability of bimodules. We also discuss how separability properties can be used to transfer some representation theoretic properties from one ring to another one: contravariant…
Branching bisimilarity on normed BPA processes was recently shown to be decidable by Yuxi Fu (ICALP 2013) but his proof has not provided any upper complexity bound. We present a simpler approach based on relative prime decompositions that…