A. H. Lachlan. Recursive real numbers. The journal of symbolic logic, vol. 28 no. 1 , pp. 1–16

Journal of Symbolic Logic 30 (2):256 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270170

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

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: A. H. Lachlan, Recursive Real Numbers. [REVIEW]Paul Axt - 1965 - Journal of Symbolic Logic 30 (2):256-256.
Schwichtenberg Helmut. Rekursionszahlen und die Grzegorczyk-Hierarchie. Archiv für mathematische Logik und Grundlagenforschung, vol. 12 , pp. 85–97. [REVIEW]R. M. Baer - 1970 - Journal of Symbolic Logic 35 (3):480.
Norman Shapiro. Functions which remain partial recursive under all similarity transformations. The journal of symbolic logic, vol. 28 no. 1 , pp. 17–19.Paul Axt - 1968 - Journal of Symbolic Logic 32 (4):527.
H. G. Rice. Recursive real numbers. Proceedings of the American Mathematical Society, vol. 5 , pp. 784–791.Norman Shapiro - 1955 - Journal of Symbolic Logic 20 (2):177.
A. H. Lachlan. On a problem of G. E. Sacks. Proceedings of the American Mathematical Society, vol. 16 , pp. 972–979.Gustav B. Hensel - 1967 - Journal of Symbolic Logic 32 (1):125.
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. [REVIEW]James C. Owings - 1970 - Journal of Symbolic Logic 35 (1):153-155.
A. H. Kruse. A method of modelling the formalism of set theory in axiomatic set theory. The journal of symbolic logic, vol. 28 no. 1 , pp. 20–34. [REVIEW]Azriel Lévy - 1966 - Journal of Symbolic Logic 31 (1):132-133.
H. B. Enderton. On provable recursive functions. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 86–88.Hartley Rogers - 1973 - Journal of Symbolic Logic 38 (3):526-527.
Paul W. Abrahams. Machine verification of mathematical proof. Mathematical algorithms, vol. 1 no. 2 , pp. 11–32; vol. 1 no. 3 , pp. 19–38; vol. 2 , pp. 28–79; vol. 3 , pp. 28–155. [REVIEW]John McCarthy - 1972 - Journal of Symbolic Logic 37 (2):411-412.
Henry A. Pogorzelski. Commutative recursive word arithmetic in the alphabet of prime numbers. Notre Dame journal of formal logic, vol. 5 no. 1 , pp. 13–23. [REVIEW]V. Vučković - 1966 - Journal of Symbolic Logic 31 (2):271.

Analytics

Added to PP
2013-11-22

Downloads
37 (#608,533)

6 months
12 (#293,221)

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