An enumeration of the primitive recursive functions without repetition

DOI10.2748/tmj/1178244403zbMath0106.00601OpenAlexW2162634125MaRDI QIDQ775448

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

Related Items (4)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Recursive Predicates and Quantifiers

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