Related papers: Kleene Algebras and Logic: Boolean and Rough Set R…

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Let G be a finite group. The Plesken Lie algebra L[G] is a subalgebra of the complex group algebra C[G] and admits a direct-sum decomposition into simple Lie algebras based on the ordinary character theory of G. In this paper we review the…

We provide a structural analysis for McCarthy algebras, the variety generated by the three-element algebra defining the logic of McCarthy (the non-commutative version of Kleene three-valued logics). Our analysis will be conducted in a very…

We define and study basic properties of *-continuous Kleene $\omega$-algebras that involve a *-continuous Kleene algebra with a *-continuous action on a semimodule and an infinite product operation that is also *-continuous. We show that…

We give a new true-concurrent model for probabilistic concurrent Kleene algebra. The model is based on probabilistic event structures, which combines ideas from Katoen's work on probabilistic concurrency and Varacca's probabilistic prime…

We show that for any class of Boolean algebras with an associative operator, if it contains the complex algebra of (P(N), U), its equational theory is undecidable. Equivalently, any associative normal modal logic valid over the frame (P(N),…

It is common in various non-classical logics, especially in relevant logics, to characterize negation semantically via the operation known as Routley star. This operation works well within relational semantic frameworks based on prime…

We use representations of operator systems as quotients to deduce various characterisations of the weak expectation property (WEP) for C?*-algebras. By Kirchberg's work on WEP, these results give new formulations of Connes' embedding…

Reactive programs are ubiquitous in modern applications, and so verification is highly desirable. We present a verification strategy for reactive programs with a large or infinite state space utilising algebraic laws for reactive relations.…

We introduce the concept of a triangular representation of a Lie algebra, give a counterpart of Ado's theorem, and discuss $2$-irreducible triangular modules over a nonreductive Lie algebra.

From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models…

Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. Later and more recent work investigated intensional…

Larsen and Skou characterized probabilistic bisimilarity over reactive probabilistic systems with a logic including true, negation, conjunction, and a diamond modality decorated with a probabilistic lower bound. Later on, Desharnais,…

We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic independence logic with the Boolean negation, and a recently…

We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the…

In this work we suggest the use of a set-theoretical interpretation of semantic tableaux for teaching propositional logic. If the student has previous notions of basic set theory, this approach to semantical tableaux can clarify her the way…

We give a decision procedure and proof of correctness for the equational theory of probabilistic Kleene algebra with angelic nondeterminism introduced in Ong, Ma, and Kozen (2025).

We show the functional completeness for the connectives of the non-trivial negation inconsistent logic C by using a well-established method implementing purely proof-theoretic notions only. Firstly, given that C contains a strong negation,…

We give a linear nested sequent calculus for the basic normal tense logic Kt. We show that the calculus enables backwards proof-search, counter-model construction and syntactic cut-elimination. Linear nested sequents thus provide the…

Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and…