The word problem for Smullyan's lark combinator is decidable

DOI10.1016/S0747-7171(89)80044-6zbMATH Open0663.03004MaRDI QIDQ1114668FDOQ1114668

Authors: Richard Statman 

Publication date: 1989

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

applicative combinatorsBWBlark combinatorparadoxical combinator

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Decidability (number-theoretic aspects) (11U05)

Cites Work

• Combinatory logic. With two sections by William Craig.
• The lambda calculus, its syntax and semantics
• Title not available (Why is that?)
• A foray into combinatory logic
• Title not available (Why is that?)

Cited In (9)

• Title not available (Why is that?)
• The combinator S
• Displaying and deciding substructural logics. I: Logics with contraposition
• Mockingbird lattices
• Title not available (Why is that?)
• On repetitive right application of \(B\)-terms
• Almost all one-rule Thue systems have decidable word problems
• 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)