An enumeration of the primitive recursive functions without repetition

DOI10.2748/TMJ/1178244403zbMATH Open0106.00601OpenAlexW2162634125MaRDI QIDQ775448FDOQ775448

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

• Title not available (Why is that?)
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Recursive Predicates and Quantifiers
• Title not available (Why is that?)

Cited In (4)

• Enumeration of families of general recursive functions
• VARIANTS OF KREISEL’S CONJECTURE ON A NEW NOTION OF PROVABILITY
• Extension of partial recursive functions and functions with a recursive graph
• 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)