A theory of rules for enumerated classes of functions

DOI10.1007/BF01269876zbMath0823.03005MaRDI QIDQ1805407

Andreas Schlüter

Publication date: 31 October 1995

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

explicit mathematicsconstructive logicenumerating functioncomputable functionuniversal algorithmabstract Recursion Theoremmodification of combinatory logic

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Other constructive mathematics (03F65) Metamathematics of constructive systems (03F50) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Effective applicative structures ⋮ On the proof theory of type two functionals based on primitive recursive operations ⋮ The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule

Cites Work

• Unnamed Item
• Unnamed Item
• The lambda calculus, its syntax and semantics
• Understanding uniformity in Feferman's explicit mathematics
• A well-ordering proof for Feferman's theoryT 0
• Partial Applicative Theories and Explicit Substitutions

This page was built for publication: A theory of rules for enumerated classes of functions