English
Related papers

Related papers: Algebraic Proof Theory for Infinitary Action Logic

200 papers

This paper revisits soundness and completeness of proof systems for proving that sets of states in infinite-state labeled transition systems satisfy formulas in the modal mu-calculus. Our results rely on novel results in lattice theory,…

Logic in Computer Science · Computer Science 2023-10-04 Jeroen J. A. Keiren , Rance Cleaveland

Kleene algebra with tests (KAT) is an algebraic framework for reasoning about the control flow of sequential programs. Generalising KAT to reason about concurrent programs is not straightforward, because axioms native to KAT in conjunction…

Logic in Computer Science · Computer Science 2023-02-03 Tobias Kappé , Paul Brunet , Jurriaan Rot , Alexandra Silva , Jana Wagemaker , Fabio Zanasi

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…

Logic · Mathematics 2020-11-11 Michael C. Laskowski , Caroline A. Terry

Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include regular sets, relational algebras, and trace algebras. A Kleene algebra with tests (KAT) is a Kleene algebra with an embedded Boolean…

Logic · Mathematics 2008-01-16 James Worthington

Propositional dynamic logic (PDL) is presented in Sch\"{u}tte-style mode as one-sided semiformal tree-like sequent calculus Seq$_\omega^{\text{pdl}}$ with standard cut rule and the omega-rule with principal formulas $\left[ P^{\ast }\right]…

Logic in Computer Science · Computer Science 2021-02-24 Lev Gordeev

In this paper, homological methods together with the theory of formal languages of theoretical computer science are proved to be effective tools to determine the growth and the Hilbert series of an associative algebra. Namely, we construct…

Rings and Algebras · Mathematics 2021-04-23 Roberto La Scala , Dmitri Piontkovski

We provide a semi-grammatical description of the set of normal proofs of positive formulae in minimal predicate logic, i.e. a grammar that generates a set of schemes, from each of which we can produce a finite number of normal proofs. This…

Logic in Computer Science · Computer Science 2023-05-03 Gilles Dowek , Ying Jiang

This paper presents a substructural logic of sequents with very restricted exchange and weakening rules. It is sound with respect to sequences of measurements of a quantic system. A sound and complete semantics is provided. The semantic…

Quantum Physics · Physics 2023-07-19 Daniel Lehmann

Lorenzen's ``Algebraische und logistische Untersuchungen \"uber freie Verb\"ande'' appeared in 1951 in The journal of symbolic logic. These ``Investigations'' have immediately been recognised as a landmark in the history of infinitary proof…

Logic · Mathematics 2023-09-22 Paul Lorenzen

We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical…

Logic in Computer Science · Computer Science 2015-07-01 Clemens Kupke , Alexander Kurz , Yde Venema

A modal logic is \emph{non-iterative} if it can be defined by axioms that do not nest modal operators, and \emph{rank-1} if additionally all propositional variables in axioms are in scope of a modal operator. It is known that every…

Logic in Computer Science · Computer Science 2020-08-04 Jonas Forster , Lutz Schröder

Deep inference is a proof theoretic methodology that generalizes the standard notion of inference of the sequent calculus, whereby inference rules become applicable at any depth inside logical expressions. Deep inference provides more…

Logic in Computer Science · Computer Science 2015-07-01 Ozan Kahramanogullari

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 give the quantum subset construction of orthomodular lattice-valued finite automata, then we show the equivalence between orthomodular lattice-valued finite automata, orthomodular lattice-valued deterministic finite automata and…

Logic in Computer Science · Computer Science 2007-12-31 Yongming Li

This paper develops a proof-theoretic framework for abstract interpretation by systematically associating logical systems with finite abstractions. Building on earlier work on the internal logics of abstractions, we propose a general…

Logic in Computer Science · Computer Science 2026-05-27 Vijay D'Silva , Alessandra Palmigiano , Apostolos Tzimoulis , Caterina Urban

The note presents a further study of the class of Cuntz--Krieger type algebras. A necessary and sufficient condition is identified that ensures that the algebra is purely infinite, the ideal structure is studied, % and applied to semigraph…

Operator Algebras · Mathematics 2017-10-18 Bernhard Burgstaller

We investigate the equational theory for Kleene algebra terms with variable complements and constant complements -- (language) complement where it applies only to variables or constants -- w.r.t. languages. While the equational theory…

Logic in Computer Science · Computer Science 2025-06-03 Yoshiki Nakamura , Ryoma Sin'ya

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

A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…

Rings and Algebras · Mathematics 2007-05-23 Luigi Santocanale

We prove a decomposition theorem for the equivariant K-theory of actions of affine group schemes G of finite type over a field on regular separated noetherian algebraic spaces, under the hypothesis that the actions have finite geometric…

Algebraic Geometry · Mathematics 2007-05-23 Gabriele Vezzosi , Angelo Vistoli