Robinson Raphael M.. Arithmetical definitions in the ring of integers. Proceedings of the American Mathematical Society, Bd. 2 , S.279–284 [Book Review]

Journal of Symbolic Logic 17 (4):269-270 (1952)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2266618

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

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

Review: Raphael M. Robinson, Arithmetical Definitions in the Ring of Integers. [REVIEW]Rózsa Péter - 1952 - Journal of Symbolic Logic 17 (4):269-270.
Arithmetical Definitions in the Ring of Integers.Raphael M. Robinson - 1952 - Journal of Symbolic Logic 17 (4):269-270.
Bing Kurt. On arithmetical classes not closed under direct union. Proceedings of the American Mathematical Society, vol. 6 , pp. 836–846. [REVIEW]Abraham Robinson - 1956 - Journal of Symbolic Logic 21 (3):321-321.
Robinson Raphael M.. Undecidable—rings. Transactions of the American Mathematical Society, Bd. 70 , S.137–159.Rózsa Péter - 1952 - Journal of Symbolic Logic 17 (4):268-269.
Reviews. Raphael M. Robinson. Primitive recursive functions. Bulletin of the American Mathematical Society, Bd. 53 , S 925–942. [REVIEW]Rózsa Péter - 1948 - Journal of Symbolic Logic 13 (2):113-114.
Robinson Raphael M.. Recursion and double recursion. Bulletin of the American Mathematical Society, Bd. 54 , S. 987–993. [REVIEW]Rózsa Péter - 1949 - Journal of Symbolic Logic 14 (3):191-192.
Robinson Raphael M.. Arithmetical definability of field elements.Rózsa Péter - 1952 - Journal of Symbolic Logic 17 (4):270-270.
Review: Raphael M. Robinson, Arithmetical Definability of Field Elements. [REVIEW]Rózsa Péter - 1952 - Journal of Symbolic Logic 17 (4):270-270.
Dedekind's 1871 version of the theory of ideals.Jeremy Avigad - manuscript
Definability of the ring of integers in some infinite algebraic extensions of the rationals.Kenji Fukuzaki - 2012 - Mathematical Logic Quarterly 58 (4-5):317-332.
Robinson J. A.. A review of automatic theorem-proving. Mathematical aspects of computer science, Proceedings of symposia in applied mathematics, vol. 19, American Mathematical Society, Providence 1967, pp. 1–18. [REVIEW]L. Wos - 1974 - Journal of Symbolic Logic 39 (1):190-190.
Answer to a problem raised by J. Robinson: The arithmetic of positive or negative integers is definable from successor and divisibility.Denis Richard - 1985 - Journal of Symbolic Logic 50 (4):927-935.
McCarthy John. Computer programs for checking mathematical proofs. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 219–227. [REVIEW]J. A. Robinson - 1968 - Journal of Symbolic Logic 32 (4):523-523.
On external Scott algebras in nonstandard models of peano arithmetic.Vladimir Kanovei - 1996 - Journal of Symbolic Logic 61 (2):586-607.
Arithmetical definability of field elements.Raphael M. Robinson - 1951 - Journal of Symbolic Logic 16 (2):125-126.

Analytics

Added to PP
2016-06-30

Downloads
21 (#735,650)

6 months
7 (#425,099)

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