Journal of Symbolic Logic 66 (4):1727-1748 (2001)

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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2694971
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 65,587
Through your library

References found in this work BETA

The Lambda Calculus. Its Syntax and Semantics.E. Engeler - 1984 - Journal of Symbolic Logic 49 (1):301-303.
Introduction to Metamathematics.H. Rasiowa - 1954 - Journal of Symbolic Logic 19 (3):215-216.
Algebraic Recursion Theory.Dag Normann - 1988 - Journal of Symbolic Logic 53 (3):986-987.

Add more references

Citations of this work BETA

Diagonal Fixed Points in Algebraic Recursion Theory.Jordan Zashev - 2005 - Archive for Mathematical Logic 44 (8):973-994.

Add more citations

Similar books and articles

Disjunctions in Closure Spaces.Andrzej W. Jankowski - 1985 - Studia Logica 44 (1):11 - 24.
Operative Vs. Combinatory Spaces.Lyubomir Ivanov - 1990 - Journal of Symbolic Logic 55 (2):561-572.
Recursion Theory for Metamathematics.Raymond Merrill Smullyan - 1993 - Oxford, England: Oxford University Press.
On Effective Topological Spaces.Dieter Spreen - 1998 - Journal of Symbolic Logic 63 (1):185-221.
Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861 - 878.

Analytics

Added to PP index
2009-01-28

Total views
43 ( #253,647 of 2,461,941 )

Recent downloads (6 months)
1 ( #448,599 of 2,461,941 )

How can I increase my downloads?

Downloads

My notes