Foster, Simon David orcid.org/0000-0002-9889-9514 and Struth, Georg (2014) On the Fine-Structure of Regular Algebra. Journal of Automated Reasoning. pp. 165-197. ISSN 0168-7433
Abstract
Regular algebra is the algebra of regular expressions as induced by regular language identity. We use Isabelle/HOL for a detailed systematic study of the regular algebra axioms given by Boffa, Conway, Kozen and Salomaa. We investigate the relationships between these systems, formalise a soundness proof for the smallest class (Salomaa’s) and obtain completeness for the largest one (Boffa’s) relative to a deep result by Krob. As a case study in formalised mathematics, our investigations also shed some light on the power of theorem proving technology for reasoning with algebras and their models, including proof automation and counterexample generation.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Pure (York) |
Date Deposited: | 29 Jul 2016 09:05 |
Last Modified: | 06 Jan 2025 00:09 |
Published Version: | https://doi.org/10.1007/s10817-014-9318-9 |
Status: | Published |
Refereed: | Yes |
Identification Number: | 10.1007/s10817-014-9318-9 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:103045 |