A theory of rules for enumerated classes of functions
From MaRDI portal
Publication:1805407
DOI10.1007/BF01269876zbMath0823.03005MaRDI QIDQ1805407
Publication date: 31 October 1995
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
explicit mathematics; constructive logic; enumerating function; computable function; universal algorithm; abstract Recursion Theorem; modification of combinatory logic
03D80: Applications of computability and recursion theory
03F65: Other constructive mathematics
03F50: Metamathematics of constructive systems
03B40: Combinatory logic and lambda calculus
Related Items
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