Iteration of Relative Primitive Recursion

&
Journal of Symbolic Logic 35 (3):480 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270754

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,611

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

Axt Paul. Iteration of relative primitive recursion. Mathematische Annalen, vol. 167 , pp. 53–55.R. M. Baer - 1970 - Journal of Symbolic Logic 35 (3):480-480.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
Review: Paul Axt, Iteration of Primitive Recursion. [REVIEW]R. M. Baer - 1970 - Journal of Symbolic Logic 35 (3):479-479.
Axt Paul. Iteration of primitive recursion. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 253–255. [REVIEW]R. M. Baer - 1970 - Journal of Symbolic Logic 35 (3):479-479.
Iteration of Primitive Recursion.Paul Axt - 1965 - Mathematical Logic Quarterly 11 (3):253-255.
Iteration of Primitive Recursion.Paul Axt - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (3):253-255.
More existence theorems for recursion categories.Florian Lengyel - 2004 - Annals of Pure and Applied Logic 125 (1-3):1-41.
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
Tarski's fixed-point theorem and lambda calculi with monotone inductive types.Ralph Matthes - 2002 - Synthese 133 (1-2):107 - 129.
The equivalence of bar recursion and open recursion.Thomas Powell - 2014 - Annals of Pure and Applied Logic 165 (11):1727-1754.
Bounded iteration and unary functions.Stefano Mazzanti - 2005 - Mathematical Logic Quarterly 51 (1):89-94.
On nested simple recursion.Ján Komara - 2011 - Archive for Mathematical Logic 50 (5-6):617-624.
Ptykes in GödelsT und Definierbarkeit von Ordinalzahlen.Peter Päppinghaus - 1989 - Archive for Mathematical Logic 28 (2):119-141.
Non-definability of the Ackermann function with type 1 partial primitive recursion.Karl-Heinz Niggl - 1997 - Archive for Mathematical Logic 37 (1):1-13.
The Computational Power of ℳω.Dag Normann & Christian Rørdam - 2002 - Mathematical Logic Quarterly 48 (1):117-124.

Analytics

Added to PP
2013-11-03

Downloads
5 (#1,546,680)

6 months
3 (#984,719)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references