FIRST ORDER AXIOMATIZABILITY OF RECURSION THEORY IN CARTESIAN LINEAR COMBINATORY ALGEBRAS

Authors

  • Jordan Zashev

Keywords:

Algebraic recursion theory, axiomatic recursion theory, combinatory algebras

Abstract

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://stipendii.uni-sofia.bg/index.php/fmi/article/view/285

Issue

Vol. 90 (1998): Ann. Sofia Univ. Fac. Math and Inf.

Section

Articles