Related papers: Monadic NM-algebras
Many finite symmetric integral non-representable relation algebras, including almost all Monk algebras, can be embedded in the completion of an atomic symmetric integral representable relation algebra whose finitely-generated subalgebras…
We show that the basic categorical concept of an S-algebra as derived from the theory of Segal's Gamma-sets provides a unifying description of several constructions attempting to model an algebraic geometry over the absolute point. It…
In this paper we prove that, in the category of chain complexes, partial algebras can be functorially replaced by quasi-isomorphic algebras. In particular, partial algebras contain all of the important homological and homotopical…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
We study some homological invariants of a given generalized bound path algebra in terms of those of the algebras used in its construction. We discuss the particular case where the algebra is a generalized path algebra and give conditions…
Logic-based models can be used to build verification tools for machine learning classifiers employed in the legal field. ML classifiers predict the outcomes of new cases based on previous ones, thereby performing a form of case-based…
We introduce the notion of clone algebra, intended to found a one-sorted, purely algebraic theory of clones. Clone algebras are defined by true identities and thus form a variety in the sense of universal algebra. The most natural clone…
We prove that if A is a finite algebra with a parallelogram term that satisfies the split centralizer condition, then A is dualizable. This yields yet another proof of the dualizability of any finite algebra with a near unanimity term, but…
The notion of a $F$-manifold algebras is an algebraic description of a $F$-manifold. In this paper, we introduce the notion of Hom-$F$-manifold algebras which is generalisation of $F$-manifold algebras and Hom-Poisson algebras. We develop…
We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which…
The aim of the paper is to discuss the relations between the three kinds of objects named in the title. In a sense, this is a survey of such relations; however, some new directions are also considered. This relates, especially, to sections…
We answer an implicit question of Ian Hodkinson's. We show that atomic Pinters algebras may not be completely representable, however the class of completely representable Pinters algebras is elementary and finitely axiomatizable. We obtain…
We introduce Nominal Matching Logic (NML) as an extension of Matching Logic with names and binding following the Gabbay-Pitts nominal approach. Matching logic is the foundation of the $\mathbb{K}$ framework, used to specify programming…
In recent research, some of the present authors introduced the concept of an n-dimensional Boolean algebra and its corresponding propositional logic nCL, generalising the Boolean propositional calculus to n>= 2 perfectly symmetric truth…
The purpose of this paper is to introduce Hom-alternative algebras and Hom-Jordan algebras. We discuss some of their properties and provide construction procedures using ordinary alternative algebras or Jordan algebras. Also, we show that a…
We study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that…
Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a propositional statement,atomic propositions may yield different Boolean values at repeated…
Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "simple" modal logics can be undecidable: We show that there is…
We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…
Cohomologies of nonassociative metagroup algebras are investigated. Extensions of metagroup algebras are studied. Examples are given.