The word problem for Smullyan's lark combinator is decidable
From MaRDI portal
Publication:1114668
Recommendations
- scientific article; zbMATH DE number 1615239
- A decidable word problem without equivalent canonical term rewriting system
- On a connection between the word problem and decidability of the equational theory
- Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets
- scientific article; zbMATH DE number 2208122
- scientific article; zbMATH DE number 149873
- scientific article; zbMATH DE number 7724207
- The decision problem for some logics for finite words on infinite alphabets
- A finitely axiomatizable undecidable equational theory with recursively solvable word problems
- scientific article; zbMATH DE number 176152
Cites work
Cited in
(9)- scientific article; zbMATH DE number 1615239 (Why is no real title available?)
- The combinator S
- Displaying and deciding substructural logics. I: Logics with contraposition
- Mockingbird lattices
- scientific article; zbMATH DE number 7215287 (Why is no real title available?)
- Almost all one-rule Thue systems have decidable word problems
- On repetitive right application of \(B\)-terms
- The combinator M and the Mockingbird lattice
- How to decide the lark
This page was built for publication: The word problem for Smullyan's lark combinator is decidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114668)