How to decide the lark
From MaRDI portal
Recommendations
Cites work
- About the rewriting systems produced by the Knuth-Bendix completion algorithm
- History and basic features of the critical-pair/completion procedure
- scientific article; zbMATH DE number 3961577 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 50648 (Why is no real title available?)
- scientific article; zbMATH DE number 177826 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- On theories with a combinatorial definition of 'equivalence'
- The word problem for Smullyan's lark combinator is decidable
Cited in
(6)
This page was built for publication: How to decide the lark
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208736)