Categories

Keywords

Reprint years

DOI

10.2307/2270746

Other Versions

No versions found

Links

PhilArchive

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

Robinson Julia. General recursive functions. Proceedings of the American Mathematical Society, vol. 1 no. 6, pp. 703–718. [REVIEW]Martin Davis - 1951 - Journal of Symbolic Logic 16 (4):280-280.
Julia Robinson. Unsolvable diophantine problems. Proceedings of the American Mathematical Society, vol. 22, pp. 534–538.Robert A. DiPaola - 1972 - Journal of Symbolic Logic 37 (3):603-604.
Julia Robinson. The undecidability of algebraic rings and fields. Proceedings of the American Mathematical Society, vol. 10, pp. 950–957. [REVIEW]Julia Robinson - 1964 - Journal of Symbolic Logic 29 (1):57-58.
Robinson Julia. A note on primitive recursive functions. Ebd., S. 667–670.Rózsa Péter - 1957 - Journal of Symbolic Logic 22 (4):376-376.
Julia Robinson. Existential definability in arithmetic. Transactions of the American Mathematical Society, Bd. 72, S. 437–449.Julia Robinson - 1955 - Journal of Symbolic Logic 20 (2):182-183.
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.
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.
Martin Davis, Hilary Putnam, and Julia Robinson. The decision problem for exponential diophantine equations. Annals of mathematics, second series vol. 74 , pp. 425–436. [REVIEW]Hartley Rogers - 1970 - Journal of Symbolic Logic 35 (1):151-152.
Robert W. Robinson. Simplicity of recursively enumerable sets.The journal of symbolic logic, vol. 32 , pp. 162–172. - Robert W. Robinson. Two theorems on hyperhypersimple sets. Transactions of the American Mathematical Society, vol. 128 , pp. 531–538. - A. H. Lachlan. On the lattice of recursively enumerable sets.Transactions of the American Mathematical Society, vol. 130 , pp. 1–37. - A. H. Lachlan. The elementary theory of recursively enumerable sets. Duke mathematical journal, vol. 35 , pp. 123–146.James C. Owings - 1970 - Journal of Symbolic Logic 35 (1):153-155.
Louise Hay. On creative sets and indices of partial recursive functions. Transactions of the American Mathematical Society, vol. 120 no. 2 , pp. 359–367. - Louise Hay. Isomorphism types of index sets of partial recursive functions. Proceedings of the American Mathematical Society, vol. 17 , pp. 106–110. - Louise Hay. Index sets of finite classes of recursively enumerable sets. The journal of symbolic logic, vol. 34 , pp. 39–44. [REVIEW]Forbes D. Lewis - 1974 - Journal of Symbolic Logic 39 (1):186-187.

Analytics

Added to PP
2013-11-03

Downloads
145 (#296,495)

6 months
52 (#165,952)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Primitive iteration and unary functions.G. Germano & S. Mazzanti - 1988 - Annals of Pure and Applied Logic 40 (3):217-256.
General iteration and unary functions.G. M. Germano & S. Mazzanti - 1991 - Annals of Pure and Applied Logic 54 (2):137-178.
Generalizing proofs in monadic languages.Matthias Baaz & Piotr Wojtylak - 2008 - Annals of Pure and Applied Logic 154 (2):71-138.
The decision problem for equational bases of algebras.George F. McNulty - 1976 - Annals of Mathematical Logic 10 (3):193.

Add more citations

References found in this work

No references found.

Add more references