Abstract
It is demonstrated that we can represent Euler's φ-function by means of a Δ0-formula in such a way that the theory IΔ 0 proves the recursion equations that are characteristic for this function.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D'Aquino, P.: Local behaviour of the Chebyshev theorem in models of IΔ 0. J. Symb. Logic57, 12–27 (1992)
Berarducci, A., Intrigila, B.: Combinatorial principles in elementary number theory. Ann. Pure Appl. Logic55, No. 1 (1991)
Hájek, P., Pudlák, P.: Metamathematics of first-order arithmetics. Berlin Heidelberg New York: Springer 1993
Kaye, R.: Models of Peano arithmetic. Oxford: Clarendon Press 1991
Paris, J.B., Wilkie, A.J.: Counting Δ0 sets. Fund. Math.127, 67–76 (1987)
Smith, S.T.: Quadratic residues andx 3+y3=z3 in models ofIE 1 andIE 2 Notre Dame J. Formal Logic34, No. 3 (1993)
Smoryńiski, C.: Logical number theory, vol. I. Berlin Heidelberg New York: Springer 1991
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jumelet, M. Euler'sϕ-function in the context of IΔ 0 . Arch Math Logic 34, 197–209 (1995). https://doi.org/10.1007/BF01375521
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01375521