A Normal form Theorem for Recursive Operators in Iterative Combinatory Spaces

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (8):115-124 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19780240803

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

On the recursion theorem in iterative operative spaces.J. Zashev - 2001 - Journal of Symbolic Logic 66 (4):1727-1748.
The First Recursion Theorem for Iterative Combinatory Spaces.D. Skordev - 1979 - Mathematical Logic Quarterly 25 (3-6):69-77.
Strong storage operators and data types.Karim Nour - 1995 - Archive for Mathematical Logic 34 (1):65-78.
Iterative differential galois theory in positive characteristic: A model theoretic approach.Javier Moreno - 2011 - Journal of Symbolic Logic 76 (1):125 - 142.
A proof of the normal form theorem for the closed terms of Girard's system F by means of computability.Silvio Valentini - 1993 - Mathematical Logic Quarterly 39 (1):539-544.
Toward a constructive theory of unbounded linear operators.Feng Ye - 2000 - Journal of Symbolic Logic 65 (1):357-370.
Compactness and normality in abstract logics.Xavier Caicedo - 1993 - Annals of Pure and Applied Logic 59 (1):33-43.
Computability of compact operators on computable Banach spaces with bases.Vasco Brattka & Ruth Dillhage - 2007 - Mathematical Logic Quarterly 53 (4‐5):345-364.
How to assign ordinal numbers to combinatory terms with polymorphic types.William R. Stirton - 2012 - Archive for Mathematical Logic 51 (5):475-501.
Storage operators and directed lambda-calculus.René David & Karim Nour - 1995 - Journal of Symbolic Logic 60 (4):1054-1086.
The Church-Rosser Property in Symmetric Combinatory Logic.Katalin Bimbó - 2005 - Journal of Symbolic Logic 70 (2):536 - 556.
Diagonal fixed points in algebraic recursion theory.Jordan Zashev - 2005 - Archive for Mathematical Logic 44 (8):973-994.
Normal Forms in Combinatory Logic.Patricia Johann - 1994 - Notre Dame Journal of Formal Logic 35 (4):573-594.
Normal Gentzen deductions in the classical case.A. Palmigiano - 2000 - Logic Journal of the IGPL 8 (2):211-219.
Versions of Normality and Some Weak Forms of the Axiom of Choice.Paul Howard, Kyriakos Keremedis, Herman Rubin & Jean E. Rubin - 1998 - Mathematical Logic Quarterly 44 (3):367-382.

Analytics

Added to PP
2013-11-24

Downloads
28 (#565,512)

6 months
4 (#779,041)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dimiter Skordev
Sofia University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references