English
Related papers

Related papers: Continuous Algebras with Hypotheses

200 papers

Guarded Kleene Algebra with Tests (GKAT) is a variation on Kleene Algebra with Tests (KAT) that arises by restricting the union ($+$) and iteration ($*$) operations from KAT to predicate-guarded versions. We develop the (co)algebraic theory…

Logic in Computer Science · Computer Science 2023-02-03 Steffen Smolka , Nate Foster , Justin Hsu , Tobias Kappé , Dexter Kozen , Alexandra Silva

Guarded Kleene Algebra with Tests (GKAT) is an efficient fragment of KAT, as it allows for almost linear decidability of equivalence. In this paper, we study the (co)algebraic properties of GKAT. Our initial focus is on the fragment that…

Logic in Computer Science · Computer Science 2023-02-03 Todd Schmid , Tobias Kappé , Dexter Kozen , Alexandra Silva

We present a Coq library about Kleene algebra with tests, including a proof of their completeness over the appropriate notion of languages, a decision procedure for their equational theory, and tools for exploiting hypotheses of a…

Logic in Computer Science · Computer Science 2013-02-08 Damien Pous

The class of all $\ast$-continuous Kleene algebras, whose description includes an infinitary condition on the iteration operator, plays an important role in computer science. The complexity of reasoning in such algebras - ranging from the…

Logic · Mathematics 2025-02-18 Stepan L. Kuznetsov , Tikhon Pshenitsyn , Stanislav O. Speranski

Concurrent Kleene Algebra is an elegant tool for equational reasoning about concurrent programs. An important feature of concurrent programs that is missing from CKA is the ability to restrict legal interleavings. To remedy this we extend…

Logic in Computer Science · Computer Science 2020-05-07 Paul Brunet , David Pym

We aim at a holistic perspective on program logics, including Hoare and incorrectness logics. To this end, we study different classes of properties arising from the generalization of the aforementioned logics. We compare our results with…

Logic in Computer Science · Computer Science 2023-12-18 Lena Verscht , Benjamin Kaminski

In the present paper, we introduce a multi-type calculus for the logic of measurable Kleene algebras, for which we prove soundness, completeness, conservativity, cut elimination and subformula property. Our proposal imports ideas and…

Logic · Mathematics 2018-05-22 Giuseppe Greco , Fei Liang , Alessandra Palmigiano

Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…

Logic · Mathematics 2019-09-17 Daizhan Cheng , Jun-e Feng , Jianli Zhao , Shihua Fu

Quantitative algebras (QAs) are algebras over metric spaces defined by quantitative equational theories as introduced by the same authors in a related paper presented at LICS 2016. These algebras provide the mathematical foundation for…

Logic in Computer Science · Computer Science 2018-04-06 Radu Mardare , Prakash Panangaden , Gordon Plotkin

A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed by a subset of the authors of this paper. Examples of the systems…

Logic in Computer Science · Computer Science 2013-03-12 Marcello Bonsangue , Georgiana Caltais , Eugen-Ioan Goriac , Dorel Lucanu , Jan Rutten , Alexandra Silva

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Logic in Computer Science · Computer Science 2023-06-22 Tadeusz Litak , Dirk Pattinson , Katsuhiko Sano , Lutz Schröder

Guarded Kleene Algebra with Tests (GKAT for short) is an efficient fragment of Kleene Algebra with Tests, suitable for reasoning about simple imperative while-programs. Following earlier work by Das and Pous on Kleene Algebra, we study GKAT…

Logic in Computer Science · Computer Science 2024-05-14 Jan Rooduijn , Dexter Kozen , Alexandra Silva

We generalise the notion of coherent states to arbitrary Lie algebras by making an analogy with the GNS construction in $C^*$-algebras. The method is illustrated with examples of semisimple and non-semisimple finite dimensional Lie algebras…

Mathematical Physics · Physics 2008-11-06 Frank Antonsen

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

The concept of a Kleene algebra (sometimes also called Kleene lattice) was already generalized by the first author for non-distributive lattices under the name pseudo-Kleene algebra. We extend these concepts to posets and show how…

Rings and Algebras · Mathematics 2020-06-09 Ivan Chajda , Helmut Länger

Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgebraic or coinductive representation as infinite tries, i.e., prefix trees branching over the alphabet, has been used to obtain compact and…

Logic in Computer Science · Computer Science 2023-06-22 Dmitriy Traytel

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…

Formal Languages and Automata Theory · Computer Science 2015-01-07 Zoltán Ésik , Uli Fahrenberg , Axel Legay

First we identify the free algebras of the class of algebras of binary relations equipped with the composition and domain operations. Elements of the free algebras are pointed labelled finite rooted trees. Then we extend to the analogous…

Logic · Mathematics 2020-09-30 Brett McLean

We exhibit a uniform method for obtaining (wellfounded and non-wellfounded) cut-free sequent-style proof systems that are sound and complete for various classes of action algebras, i.e., Kleene algebras enriched with meets and residuals.…

Logic in Computer Science · Computer Science 2025-01-31 Wesley Fussner , Simon Santschi , Borja Sierra Miranda

For simply-laced quivers, we consider the fixed-point subalgebra of the quiver Hecke algebra under the homogeneous sign map. This leads to a new family of algebras we call alternating quiver Hecke algebras. We give a basis theorem and a…

Representation Theory · Mathematics 2015-04-22 Clinton Boys