Related papers: Continuous Algebra: Algebraic Semantics for Contin…
Modal fixpoint logics traditionally play a central role in computer science, in particular in artificial intelligence and concurrency. The mu-calculus and its relatives are among the most expressive logics of this type. However, popular…
Topological cylindric algebras of dimension \alpha, \alpha any ordinal are cylindric algebras with dimension \alpha expanded with \alpha S4 modalities. The S4 modalities in representable algebras are induced by a topology on the base of the…
Pseudo $MV$-algebras are a non-commutative generalization of $MV$-algebras. The main purpose of the paper is to introduce and investigate orthocomplete pseudo $MV$-algebras. We use the concepts of projectable pseudo $MV$-algebras and large…
Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause…
Fundamental logic was introduced by Wesley Holliday (2023) to unify intuitionistic logic and quantum logic from a proof-theoretic perspective, capturing the logic determined solely by the introduction and elimination rules of connectives…
The algebraic lambda calculus and the linear algebraic lambda calculus are two extensions of the classical lambda calculus with linear combinations of terms. They arise independently in distinct contexts: the former is a fragment of the…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
Suszko's Sentential Calculus with Identity SCI results from classical propositional calculus CPC by adding a new connective $\equiv$ and axioms for identity $\varphi\equiv\psi$ (which we interpret here as `propositional identity'). We…
We present constructive provability logic, an intuitionstic modal logic that validates the L\"ob rule of G\"odel and L\"ob's provability logic by permitting logical reflection over provability. Two distinct variants of this logic, CPL and…
In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $\sigma$-additive probability models, and subsequently when this class of…
We examine rigidity phenomena for representations of amenable operator algebras which have an ideal of compact operators. We establish that a generalized version of Kadison's conjecture on completely bounded homomorphisms holds for the…
Generalized current algebras introduced by Alekseev and Strobl in two dimensions are reconstructed by a graded manifold and a graded Poisson brackets. We generalize their current algebras to higher dimensions. QP manifolds provide the…
The paper is devoted to several questions related to the notion of Cohomological Hall algebra (COHA for short) introduced few years ago by Maxim Kontsevich and the author. In particular we discuss a class of representations of COHA in the…
We generalize some facts about function algebras to operator algebras, using the `noncommutative Shilov boundary' or $C^*$-envelope first considered by Arveson. In the first part we study and characterize complete isometries between…
We study a generalization of graded Hecke algebras introduced by Drinfeld in 1986, in which the role of a finite group G is played by a reductive algebraic group. This includes continuous generalizations of symplectic reflection algebras…
Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson's early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of…
Cuntz and Li have defined a C*-algebra associated to any integral domain, using generators and relations, and proved that it is simple and purely infinite and that it is stably isomorphic to a crossed product of a commutative C*-algebra. We…
Conjunctive table algebras are introduced and axiomatically characterized. A conjunctive table algebra is a variant of SPJR algebra (a weaker form of relational algebra), which corresponds to conjunctive queries with equality. The table…
We define a class of associative algebras generalizing 'clannish algebras', as introduced by the second author, but also incorporating semilinear structure, like a skew polynomial ring. Clannish algebras generalize the well known 'string…
The work is devoted to Computability Logic (CoL) -- the philosophical/mathematical platform and long-term project for redeveloping classical logic after replacing truth} by computability in its underlying semantics (see…