On the recursion theorem in iterative operative spaces

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

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,164

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

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 - New York: 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
2009-01-28

Downloads
51 (#296,600)

6 months
6 (#403,662)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Diagonal fixed points in algebraic recursion theory.Jordan Zashev - 2005 - Archive for Mathematical Logic 44 (8):973-994.

Add more citations

References found in this work

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