"The Word Problem for Smullyan's Lark Combinator is Decidable."

Richard Statman (1989)

Details and statistics

DOI: 10.1016/S0747-7171(89)80044-6

access: open

type: Journal Article

metadata version: 2021-02-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics