Completeness of Proof Systems for Equational Specifications
From MaRDI portal
Recommendations
Cited in
(18)- Structured algebraic specifications: A kernel language
- Specifications in an arbitrary institution
- Soundness and completeness of the Birkhoff equational calculus for many-sorted algebras with possibly empty carrier sets
- Which data types have -complete initial algebra specifications?
- Structured theory presentations and logic representations
- Proof equivalence in MLL is PSPACE-complete
- A New and Formalized Proof of Abstract Completion
- Towards Complete Reasoning about Axiomatic Specifications
- scientific article; zbMATH DE number 3913659 (Why is no real title available?)
- scientific article; zbMATH DE number 3943001 (Why is no real title available?)
- scientific article; zbMATH DE number 4041873 (Why is no real title available?)
- scientific article; zbMATH DE number 553883 (Why is no real title available?)
- scientific article; zbMATH DE number 604880 (Why is no real title available?)
- scientific article; zbMATH DE number 1372677 (Why is no real title available?)
- Proving and rewriting
- Higher-order order-sorted algebras
- Term Rewriting and Applications
- On the completeness of modular proof systems
This page was built for publication: Completeness of Proof Systems for Equational Specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347269)
