Representability of Partial Recursive Functions in Formal Theories

DOI10.2307/2035433zbMath0207.30504OpenAlexW4229819421MaRDI QIDQ5607995

William Ernest Ritter

Publication date: 1967

Full work available at URL: https://doi.org/10.2307/2035433

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

Computability of partial functions and enumerability of sets in Peano's arithmetic

Cites Work

• Unnamed Item
• Undecidable theories
• Representability of recursively enumerable sets in formal theories
• Representability op recursively enumerable sets in formal theories

This page was built for publication: Representability of Partial Recursive Functions in Formal Theories