An enumeration of the primitive recursive functions without repetition

DOI10.2748/TMJ/1178244403MaRDI QIDQ775448zbMATH OpenOpenAlexFDO

Authors Shih-Chao Liu

Publication date 1960

Published in Tôhoku Mathematical Journal. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2748/tmj/1178244403

zbMATH Keywords

logics, foundations, philosophy

Cites work

• scientific article; zbMATH DE number 3066801 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Recursive Predicates and Quantifiers
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

Cited in

(4)

• Extension of partial recursive functions and functions with a recursive graph
• Enumeration of families of general recursive functions
• VARIANTS OF KREISEL’S CONJECTURE ON A NEW NOTION OF PROVABILITY
• A learning-theoretic characterization of classes of recursive functions

This page was built for publication: An enumeration of the primitive recursive functions without repetition

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