Related papers: Towards Spatial Bisimilarity for Closure Models: L…
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…
Given a finite collection of probability measures defined on subsets of a measurable space, how can we determine if they are compatible, in the sense that they can be realized as conditional distributions of a single probability measure on…
Topological spaces - such as classifying spaces, configuration spaces and spacetimes - often admit extra temporal structure. Qualitative invariants on such directed spaces often are more informative yet more difficult to calculate than…
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…
Coalgebra, as the abstract study of state-based systems, comes naturally equipped with a notion of behavioural equivalence that identifies states exhibiting the same behaviour. In many cases, however, this equivalence is finer than the…
We consider the space of functions almost in $L_p$ and endow it with the topology of asymptotic $L_p$-convergence. This yields a completely metrizable topological vector space which, on finite measure spaces, coincides with the space of…
We discuss a universal algebraic approach to quasi-exactly solvable models which allows us to interpret them as constrained Hamiltonian systems with a finite number of physical states. Using this approach we reproduce well-known…
We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…
The paper investigates behavioural equivalence between programs in a call-by-value functional language extended with a signature of (algebraic) effect-triggering operations. Two programs are considered as being behaviourally equivalent if…
We address in this paper the co-clustering and co-classification of bilingual data laying in two linguistic similarity spaces when a comparability measure defining a mapping between these two spaces is available. A new approach that we can…
Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…
Algorithms for computing congruence closure of ground equations over uninterpreted symbols and interpreted symbols satisfying associativity and commutativity (AC) properties are proposed. The algorithms are based on a framework for…
Most CAD or other spatial data models, in particular boundary representation models, are called "topological" and represent spatial data by a structured collection of "topological primitives" like edges, vertices, faces, and volumes. These…
We present a model-theoretic property of finite structures, that can be seen to be a finitary analogue of the well-studied downward L\"owenheim-Skolem property from classical model theory. We call this property as the…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…
The goal of this paper is to describe the application of quasi-likelihood estimating equations for spatially correlated binary data. In this paper, a logistic function is used to model the marginal probability of binary responses in terms…
The bialgebraic abstract GSOS framework by Turi and Plotkin provides an elegant categorical approach to modelling the operational and denotational semantics of programming and process languages. In abstract GSOS, bisimilarity is always a…
The local zero structure of a smooth map may qualitatively change, when the map is subjected to small perturbations. The changes may include births and/or deaths of zeros. The qualitative properties are defined as the invariances of an…
On relational structures and on polymodal logics, we describe operations which preserve local tabularity. This provides new sufficient semantic and axiomatic conditions for local tabularity of a modal logic. The main results are the…