Related papers: A mixed logic with binary operators
Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…
We give two constructions of grading-restricted vertex (super)algebras. We first give a new construction of a class of grading-restricted vertex (super)algebras originally obtained by Meurman and Primc using a different method. This…
We introduce hybrid algebras as algebraic semantics for hybrid languages with nominals and, possibly, the satisfaction operator. We establish a duality between hybrid algebras and the descriptive two-sorted general frames of Ten Cate. We…
In this paper we introduce the notion of existentially closed Leibniz algebras. Then we use HNN-extensions of Leibniz algebras in order to prove an embedding theorem.
We propose two new dependent type systems. The first, is a dependent graded/linear type system where a graded dependent type system is connected via modal operators to a linear type system in the style of Linear/Non-linear logic. We then…
The aim of this paper is to introduce an algebraic structure on the set of all coalgebras with the same state space over the given type which allows us to present definitions of weak and delay bisimulation for coalgebras. Additionally, we…
We present generalization of the Bloom variety theorem of ordered algebras in fuzzy setting. We introduce algebras with fuzzy orders which consist of sets of functions which are compatible with particular binary fuzzy relations called fuzzy…
We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple…
In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…
A efficient incremental learning algorithm for classification tasks, called NetLines, well adapted for both binary and real-valued input patterns is presented. It generates small compact feedforward neural networks with one hidden layer of…
Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…
The topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial…
It is shown how to endow a hierarchy of sets of binary patterns with the structure of an abstract,normed C*-algebra. In the course we also recover an intermediate connection with the words of a Dyck language and Tempereley-Lieb algebras for…
In a previous paper with Kashyap we generalized the theory of $W^*$-modules to the setting of modules over nonselfadjoint dual operator algebras, obtaining the class of weak*-rigged modules. The present paper and its contemporaneous…
An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…
Circuit algebras are a symmetric analogue of Jones's planar algebras introduced to study finite-type invariants of virtual knotted objects. Circuit algebra structures appear, in different forms, across mathematics. This paper provides a…
Language theory, symbolic dynamics, modelisation of viral insertion into the genetic code of a host cell motivate the introduction of new types of bialgebras whose coalgebra parts are not necessarily coassociative. One of the aim of this…
We study connections between closure operators on an algebra $(A,\Om)$ and congruences on the extended power algebra defined on the same algebra. We use these connections to give an alternative description of the lattice of all subvarieties…
In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…
We study the minus order on the algebra of bounded linear operators on a Hilbert space. By giving a characterization in terms of range additivity, we show that the intrinsic nature of the minus order is algebraic. Applications to…