The logical meaning of programs of a subrecursive language

DOI10.1016/0020-0190(76)90025-9MaRDI QIDQ1222017zbMATH OpenOpenAlexFDO

Authors Wolfgang Coy

Publication date 1976

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(76)90025-9

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Applications of computability and recursion theory (03D80)

Cites work

• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• scientific article; zbMATH DE number 3403733 (Why is no real title available?)
• scientific article; zbMATH DE number 3420251 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Subrecursive Programming Languages, Part I

This page was built for publication: The logical meaning of programs of a subrecursive language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1222017)