English
Related papers

Related papers: Kleene Algebra with Dynamic Tests: Completeness an…

200 papers

This paper continues the investigation of the logic of competing theories, be they scientific, social, political etc. We introduce a many-valued, multi-type modal language which we endow with relational semantics based on enriched reflexive…

Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…

Logic in Computer Science · Computer Science 2019-03-27 Miika Hannula , Lauri Hella

Guarded Kleene Algebra with Tests (GKAT) is the fragment of Kleene Algebra with Tests (KAT) that arises by replacing the union and iteration operations of KAT with predicate-guarded variants. GKAT is more efficiently decidable than KAT and…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Stefan Zetzsche , Alexandra Silva , Matteo Sammartino

We investigate the algebraic reasoning of quantum programs inspired by the success of classical program analysis based on Kleene algebra. One prominent example of such is the famous Kleene Algebra with Tests (KAT), which has furnished both…

Programming Languages · Computer Science 2022-03-30 Yuxiang Peng , Mingsheng Ying , Xiaodi Wu

We provide a new foundational approach to the generalization of terms up to equational theories. We interpret generalization problems in a universal-algebraic setting making a key use of projective and exact algebras in the variety…

Logic · Mathematics 2026-03-31 Tommaso Flaminio , Sara Ugolini

We present a version of arithmetic in all finite types which allows for a definition of equality at higher types for which all congruence are derivable, for which the soundness of the Dialectica interpretation is provable inside the system…

Logic · Mathematics 2016-09-21 Benno van den Berg

We introduce Kleene-Varlet spaces as partially ordered sets equipped with a polarity satisfying certain additional conditions. By applying Kleene-Varlet spaces, we prove that each regular pseudocomplemented Kleene algebra is isomorphic to a…

Logic · Mathematics 2019-10-23 Jouni Järvinen , Sándor Radeleczki

Given a lattice $\mathbb{L}$ and a class $K$ of algebraic structures, we say that $\mathbb{L}$ \emph{forces nilpotency} in $K$ if every algebra $\mathbf{A} \in K$ whose congruence lattice $\mathrm{Con} (\mathbf{A})$ is isomorphic to…

Rings and Algebras · Mathematics 2020-11-30 Erhard Aichinger

We introduce a generic expression language describing behaviours of finite coalgebras over sets; besides relational systems, this covers, e.g., weighted, probabilistic, and neighbourhood-based system types. We prove a generic Kleene-type…

Logic in Computer Science · Computer Science 2018-05-21 Ulrich Dorsch , Stefan Milius , Lutz Schröder , Thorsten Wißmann

In this paper we extend to a generic class of piecewise smooth dynamical systems a fundamental tool for the analysis of convergence of smooth dynamical systems: contraction theory. We focus on switched systems satisfying Caratheodory…

Optimization and Control · Mathematics 2011-10-06 Mario di Bernardo , Davide Liuzza , Giovanni Russo

We introduce an expressive probabilistic temporal epistemic logic PTEL suitable to reason about uncertain knowledge of a non-rigid set of agents that can be changed during time. We define semantics for PTEL as Kripke models with epistemic…

Logic · Mathematics 2021-05-27 Zoran Ognjanović , Angelina Ilić Stepić , Aleksandar Perović

Logics for social networks have been studied in recent literature. This paper presents a framework based on *dynamic term-modal logic* (DTML), a quantified variant of dynamic epistemic logic (DEL). In contrast with DEL where it is commonly…

Multiagent Systems · Computer Science 2019-08-27 Andrés Occhipinti Liberman , Rasmus K. Rendsvig

The interpretation of propositional dynamic logic (PDL) through Kripke models requires the relations constituting the interpreting Kripke model to closely observe the syntax of the modal operators. This poses a significant challenge for an…

Logic in Computer Science · Computer Science 2011-09-19 Ernst-Erich Doberkat

The degree of Kripke-incompleteness of a logic $L$ in some lattice $\mathcal{L}$ of logics is the cardinality of logics in $\mathcal{L}$ which share the same class of Kripke-frames with $L$. A celebrated result on Kripke-incompleteness is…

Logic · Mathematics 2025-09-25 Qian Chen

We classify extensions of certain classifiable C*-algebras using the six term exact sequence in K-theory together with the positive cone of the K_0-groups of the distinguished ideal and quotient. We then apply our results to a class of…

Operator Algebras · Mathematics 2014-10-01 Soren Eilers , Gunnar Restorff , Efren Ruiz

In a previous paper, we showed that profinite $L$-algebras (where $L$ is a variety of modal algebras generated by its finite members) are monadic over $\mathbf{Set}$. This monadicity result suggests that profinite $L$-algebras could be…

Logic · Mathematics 2025-11-21 Matteo De Berardinis , Silvio Ghilardi

We introduce Morita equivalence to the study of Kleene algebras and modules. Classical characterizations of Morita-equivalent semirings such as having equivalent categories of modules and one semiring being a full matrix algebra over the…

Logic in Computer Science · Computer Science 2026-03-03 Luke Serafin

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

We develop a linear-algebraic framework for dimensional analysis in systems with constraints, particularly when variables are numerous or related by implicit relations so that direct elimination is impractical. By expressing both…

Mathematical Physics · Physics 2026-03-31 Umpei Miyamoto

We elucidate a close connection between the Theory of Judgment Aggregation (more generally, Evaluation Aggregation), and a relatively young but rapidly growing field of universal algebra, that was primarily developed to investigate…

Computational Complexity · Computer Science 2015-06-04 Mario Szegedy , Yixin Xu