Related papers: Subordination algebras in modal logic
This work is divided between two main areas: in the theory of multialgebras, we focus mostly on a new definition of what a freely generated object should be in their category, and on how this category is equivalent to another with partially…
We characterize vertex algebras (in a suitable sense) as algebras over a certain graded co-operad. We also discuss some examples and categorical implications of this characterization.
Leibniz algebras are non-antisymmetric generalizations of Lie algebras that have attracted substantial interest due to their close relation with the latter class. A Leibniz algebra $A$ is called perfect if it coincides with its derived…
This paper is about Kripke structures that are inside a relational database and queried with a modal language. At first the modal language that is used is introduced, followed by a definition of the database and relational algebra. Based on…
In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…
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…
This paper puts forth a class of algebraic structures, relativized Boolean algebras (RBAs), that provide semantics for propositional logic in which truth/validity is only defined relative to a local domain. In particular, the join of an…
After recalling the notion of Lie algebroid, we construct these structures associated with contact forms or systems. We are then interested in particular classes of Lie Rinehart algebras.
This thesis aims to provide a suite of techniques to generate completeness results for coalgebraic logics with axioms of arbitrary rank. We have chosen to investigate the possibility to generalize what is arguably one of the most successful…
Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…
First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…
This paper is concerned with two generalizations of the Hopf algebra of symmetric functions that have more or less recently appeared. The Hopf algebra of noncommutative symmetric functions and its dual, the Hopf algebra of quasisymmetric…
For a finite group $G$, we construct a simplified model for the $G$-symmetric monoidal $G$-$\infty$-category of rational $G$-spectra. Using this model, we classify $\mathcal{I}$-normed algebras in rational $G$-spectra for a given indexing…
We exhibit two relation algebra atom structures such that they are elementarily equivalent but their term algebras are not. This answers Problem 14.19 in the book Hirsch, R. and Hodkinson, I., "Relation Algebras by Games", North-Holland,…
We study the modal logic of the closure algebra $P_2$, generated by the set of all polygons in the Euclidean plane $\mathbb{R}^2$. We show that this logic is finitely axiomatizable, is complete with respect to the class of frames we call…
Drawing on the classic paper by Chellas "Basic conditional logic" (1975), we propose a general algebraic framework for studying a binary operation of conditional that models universal features of the "if..., then..." connective as strictly…
We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…
Algebras on the natural numbers and their clones of term operations can be classified according to their descriptive complexity. We give an example of a closed algebra which has only unary operations and whose clone of term operations is…
We study equations over relational structures that approximate groups and semigroups. For such structures we proved the criteria, when a direct power of such algebraic structures is equationally Noetherian.
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…