Related papers: Taming Multirelations
We consider varieties generated by finite closure algebras whose canonical relations have two levels, and whose restriction to a level is an "extremal" relation, i.e. the identity or the universal relation. The corresponding logics have…
This paper introduces a new behavioral system model with distinct external and internal signals possibly evolving on different time scales. This allows to capture abstraction processes or signal aggregation in the context of control and…
The standard engineering approach to modelling of complex systems is highly compositional. In order to be able to understand (or to control) the behavior of a complex dynamical systems, it is often desirable, if not necessary, to view this…
In this paper we introduce and experimentally compare alternative algorithms to join uncertain relations. Different algorithms are based on specific principles, e.g., sorting, indexing, or building intermediate relational tables to apply…
We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even…
We discuss a general method to construct correlated binomial distributions by imposing several consistent relations on the joint probability function. We obtain self-consistency relations for the conditional correlations and conditional…
Polyadic systems and their representations are reviewed and a classification of general polyadic systems is presented. A new multiplace generalization of associativity preserving homomorphisms, a 'heteromorphism' which connects polyadic…
General relativity does not allow one to specify the topology of space, leaving the possibility that space is multi-- rather than simply--connected. We review the main mathematical properties of multi--connected spaces, and the different…
We study approximations of theories both in general context and with respect to some natural classes of theories. Some kinds of approximations are considered, connections with finitely axiomatizable theories and minimal generating sets of…
We study the distribution of quantum correlations characterized by monogamy relations in multipartite systems. By using the Hamming weight of the binary vectors associated with the subsystems, we establish a class of monogamy inequalities…
We revisit the behavioral approach to systems theory and make explicit the abstract pattern that governs it. Our end goal is to use that pattern to understand interaction-related phenomena that emerge when systems interact. Rather than…
We introduce a generalization of entanglement based on the idea that entanglement is relative to a distinguished subspace of observables rather than a distinguished subsystem decomposition. A pure quantum state is entangled relative to such…
Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which…
An algebra is finitely related (or has finite degree) if its term functions are determined by some finite set of finitary relations. Nilpotent monoids built from words, via Rees quotients of free monoids, have been used to exhibit many…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
We relativise double categories of relations to stable orthogonal factorisation systems. Furthermore, we present the characterisation of the relative double categories of relations in two ways. The first utilises a generalised comprehension…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
Different semantic interpretation tasks such as text entailment and question answering require the classification of semantic relations between terms or entities within text. However, in most cases it is not possible to assign a direct…
Type theory plays an important role in foundations of mathematics as a framework for formalizing mathematics and a base for proof assistants providing semi-automatic proof checking and construction. Derivation of each theorem in type theory…
We present module theory and linear maps as a powerful generalised and computationally efficient framework for the relational data model, which underpins today's relational database systems. Based on universal constructions of modules we…