Abstract.
This paper is a sequel to my [7]. It focuses on the notion of natural number as introduced in section 11 of that paper with regard to forms of induction and recursive definitions. One point is that this notion of natural number is somewhat weaker than the classical one in so far as it is defined in terms of a weak implication. The other point is the lack of even a weak form of extensionality. As a main result of the present paper it will turn out that the means provided in [7] are sufficient to account for an interpretation of primitive recursive arithmetic.
Similar content being viewed by others
References
Boolos, G., Jeffrey, R.: Computability and Logic. Cambridge University Press: Cambridge 1974
Epstein, R.L., Carnielli, W.A.: Computability: computable functions, logic, and the foundations of mathematics. Wadsworth 2000 (second edition).
Girard, J.-Y.: Linear Logic: Its Syntax and Semantics. Advances in Linear Logic (J.-Y. Girard, Y. Lafont, L. Reignier, eds.). Cambridge University Press (London Mathematical Society Lecture Note Series 222): Cambridge 1995, pp. 1–42
Girard, J.-Y.: Light Linear Logic. Logic and computational complexity (Leivant, ed.) LNCS 960. Springer Verlag 1995, pp. 145–176
Hilbert, D., Bernays, P.: Grundlagen der Mathematik, Vol.I. Springer Verlag: Berlin und Göttingen, 1968
Petersen, U.: Die logische Grundlegung der Dialektik. Wilhelm Fink Verlag: München, 1980
Petersen, U.: Logic Without Contraction as Based on Inclusion and Unrestricted Abstraction. Studia Logica 64, 365–403 (2000)
White, R.B.: A Consistent Theory of Attributes in a Logic Without Contraction. Studia Logica 52, 113–142 (1993)
Author information
Authors and Affiliations
Corresponding author
Additional information
Mathematics Subject Classification (2000):
Rights and permissions
About this article
Cite this article
Petersen, U. L i D Z λ as a basis for PRA. Arch. Math. Logic 42, 665–694 (2003). https://doi.org/10.1007/s00153-003-0175-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-003-0175-1