Completeness and the finite model property for Kleene algebra, reconsidered
From MaRDI portal
Publication:6174420
DOI10.1007/978-3-031-28083-2_10arXiv2212.10931OpenAlexW4323527450MaRDI QIDQ6174420
Publication date: 17 August 2023
Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.10931
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial derivatives of regular expressions and finite automaton constructions
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- A completeness theorem for Kleene algebras and the algebra of regular events
- Universal coalgebra: A theory of systems
- Left-handed completeness
- On the fine-structure of regular algebra
- A fast compiler for NetKAT
- Une remarque sur les systèmes complets d'identités rationnelles
- The Böhm–Jacopini Theorem Is False, Propositionally
- Left-Handed Completeness for Kleene algebra, via Cyclic Proofs
- NetKAT
- Two Complete Axiom Systems for the Algebra of Regular Events
- Programming Techniques: Regular expression search algorithm
- Derivatives of Regular Expressions
- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
- Completeness and the finite model property for Kleene algebra, reconsidered
This page was built for publication: Completeness and the finite model property for Kleene algebra, reconsidered
