Abstract
Standard completion cannot be applied to equations, such as commutativity, for which the corresponding rewrite relation is non-terminating. There are also limitations in applications to theories with associativity or similar so-called per mutative equations, as such theories often cannot be represented by finite convergent rewrite systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Birkhäuser Boston
About this chapter
Cite this chapter
Bachmair, L. (1991). Extended Completion. In: Canonical Equational Proofs. Progress in Theoretical Computer Science. Birkhäuser Boston. https://doi.org/10.1007/978-1-4684-7118-2_3
Download citation
DOI: https://doi.org/10.1007/978-1-4684-7118-2_3
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-3555-8
Online ISBN: 978-1-4684-7118-2
eBook Packages: Springer Book Archive