The Ackermann function in elementary algebraic geometry

Abstract

We can equivalently present this by the recursion equations f1(n) = 2n, fk+1(1) = fk(1), fk+1(n+1) = fk(fk+1(n)), where k,n ≥ 1. We define A(k,n) = fk(n).

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

Sentential constants in systems near R.John Slaney - 1993 - Studia Logica 52 (3):443 - 455.
Geometry of *-finite types.Ludomir Newelski - 1999 - Journal of Symbolic Logic 64 (4):1375-1395.
Formalization of Hilbert's geometry of incidence and parallelism.Jan Platvono - 1997 - Synthese 110 (1):127-141.
Formalization of Hilbert's geometry of incidence and parallelism.Jan von Plato - 1997 - Synthese 110 (1):127-141.
Sur la théorie élémentaire Des corps de fonctions.Jean-Louis Duret - 1986 - Journal of Symbolic Logic 51 (4):948-956.
Fourfold Geometry: being the Elementary Geometry of the Four-Dimensional World, By David Beveridge Mair. [REVIEW]T. P. Nunn - 1927 - Philosophy 2 (5):113.
The distance function in commutative ℓ-semigroups and the equivalence in łukasiewicz logic.Andrzej Wroński - 2004 - Studia Logica 77 (2):241 - 253.
Topological elementary equivalence of closed semi-algebraic sets in the real plane.Bart Kuijpers, Jan Paredaens & Jan Van den Bussche - 2000 - Journal of Symbolic Logic 65 (4):1530-1555.
A consistency proof for elementary algebra and geometry.Harvey Friedman - manuscript

Analytics

Added to PP
2009-01-28

Downloads
175 (#111,679)

6 months
1 (#1,474,534)

Historical graph of downloads
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