Journal of Symbolic Logic 31 (4):654-654 (1966)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Reprint years 1997
DOI 10.2307/2269715
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: 54,646
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

The Ackermann Functions Are Not Optimal, but by How Much?H. Simmons - 2010 - Journal of Symbolic Logic 75 (1):289-313.
A Theory of Rules for Enumerated Classes of Functions.Andreas Schlüter - 1995 - Archive for Mathematical Logic 34 (1):47-63.
A Foundation for Real Recursive Function Theory.José Félix Costa, Bruno Loff & Jerzy Mycka - 2009 - Annals of Pure and Applied Logic 160 (3):255-288.
Implicit Dynamic Function Introduction and Ackermann-Like Function Theory.Marcos Cramer - forthcoming - IfCoLog Journal of Logics and Their Applications.
Plain Bases for Classes of Primitive Recursive Functions.Stefano Mazzanti - 2002 - Mathematical Logic Quarterly 48 (1):93-104.
Classes of Predictably Computable Functions.Robert W. Ritchie - 1963 - Journal of Symbolic Logic 28 (3):252-253.
Accessible Recursive Functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
Ackermann’s Substitution Method.Georg Moser - 2006 - Annals of Pure and Applied Logic 142 (1):1-18.

Analytics

Added to PP index
2013-11-03

Total views
27 ( #376,702 of 2,385,975 )

Recent downloads (6 months)
2 ( #369,659 of 2,385,975 )

How can I increase my downloads?

Downloads

My notes