FIRST ORDER AXIOMATIZABILITY OF RECURSION THEORY IN CARTESIAN LINEAR COMBINATORY ALGEBRAS
Keywords:
Algebraic recursion theory, axiomatic recursion theory, combinatory algebrasAbstract
A modification of recursion theorem in Cartesian linear combinatory algebras is proved which yields first order formalizability of theory of the last algebras. Some other improvements of this theory are demonstrated.
Downloads
Published
1998-12-12
How to Cite
Zashev, J. (1998). FIRST ORDER AXIOMATIZABILITY OF RECURSION THEORY IN CARTESIAN LINEAR COMBINATORY ALGEBRAS. Ann. Sofia Univ. Fac. Math. And Inf., 90, 41–50. Retrieved from https://ftl5.uni-sofia.bg/index.php/fmi/article/view/285
Issue
Section
Articles