Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-15T05:36:44.521Z Has data issue: false hasContentIssue false
  • English
  • Français

On the recursion theorem in iterative operative spaces

Published online by Cambridge University Press:  12 March 2014

J. Zashev
J. Zashev*
Affiliation:
Section of Mathematical Logic, Institute of Mathematics & Informatics, Boul, G.Bonchev BL.8, Sofia 1113, Bulgaria, E-Mail: yzhsv@fmi.uni-sofia.bg
Get accessRights & Permissions [Opens in a new window]

Abstract.

The recursion theorem in abstract partially ordered algebras, such as operative spaces and others, is the most fundamental result of algebraic recursion theory. The primary aim of the present paper is to prove this theorem for iterative operative spaces in full generality. As an intermediate result, a new and rather large class of models of the combinatory logic is obtained.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 66 , Issue 4 , December 2001, pp. 1727 - 1748
Copyright
Copyright © Association for Symbolic Logic 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[1]Barendregt, H. P., The lambda calculus: Its syntax and semantics, Nort-Holland, Amsterdam, 1984.Google Scholar
[2]Ivanov, L. L., A simpler first order mu-induction axiom for operative spaces, unpublished manuscript.Google Scholar
[3]Ivanov, L. L., Iterative operative spaces, Ph.D. thesis, Sofia University, 1980. in Bulgarian.Google Scholar
[4]Ivanov, L. L., Algebraic recursion theory, Ellis Horwood, Chichester, 1986.Google Scholar
[5]Kleene, S. C., Introduction to metamathematics, Noordhof N. V., Groningen, 1952.Google Scholar
[6]Moschovakis, Y. N., Abstract first order computability, Transactions of the American Mathematical Society, vol. 138 (1969), pp. 427–504.Google Scholar
[7]Skordev, D. G., Recursion theory on iterative combinatory spaces, Bulletin de l'Académie Polonaise des Sciences, vol. 24 (1976), pp. 23–31.Google Scholar
[8]Skordev, D. G., Some models of combinatory logic, Mathematical Notes, vol. 19 (1976), no. 1, pp. 88–90.CrossRefGoogle Scholar
[9]Skordev, D. G., Combinatory spaces and recursiveness in them, BAN, Sofia, 1980, in Russian. English summary.Google Scholar
[10]Skordev, D. G., Computability in Combinatory Spaces, 1992, Amsterdam.CrossRefGoogle Scholar
[11]Zashev, J., Diagonal fixed points in algebraic recursion theory, submitted.Google Scholar
[12]Zashev, J., Recursion theory in partially ordered combinatory models, Ph.D. thesis, Sofia University, 1983, (In Bulgarian).Google Scholar
[13]Zashev, J., Least fixed points in preassociative combinatory algebras, Mathematical logic (Petkov, P., editor), Plenum Press, New York, 1990, pp. 389–397.CrossRefGoogle Scholar
[14]Zashev, J., Categorial generalization of algebraic recursion theory, Journal of Pure and Applied Algebra, vol. 101 (1995), pp. 91–128.CrossRefGoogle Scholar
[15]Zashev, J., First order axiomatizability of recursion theory in cartesian linear combinatory algebras, Annuaire de l'Université de Sofia “St. Kliment Okhridski”. Faculté de Mathématiques et Informatique, vol. 90 (1998), pp. 41–50.Google Scholar