Michael Anderson. Approximation to a decision procedure for the halting problem. Notre Dame journal of formal logic, vol. 9 no. 4 , pp. 305–312 [Book Review]

Journal of Symbolic Logic 35 (3):480 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270757

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,337

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

Approximation to a decision procedure for the halting problem.Michael Anderson - 1968 - Notre Dame Journal of Formal Logic 9 (4):305-312.
Sobociński Bolesław. Remarks about axiomatizations of certain modal systems. Notre Dame journal of formal logic, vol. 5 no. 1 , pp. 71–80.Prior A. N., K1, K2 and related modal systems. Notre Dame journal of formal logic, vol. 5 no. 4 , pp. 299–304.Sobociński Bolesław. Modal system S4.4. Notre Dame journal of formal logic, vol. 5 no. 4 , pp. 305–312.Sobociński Bolesław. Family of the non-Lewis modal systems. Notre Dame journal of formal logic, vol. 5 no. 4 , pp. 313–318.Thomas Ivo. A theorem on S4.2 and S4.4. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 335–336.Thomas Ivo. Decision for K4. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 337–338. [REVIEW]G. F. Schumm - 1972 - Journal of Symbolic Logic 37 (1):182-183.
Summersbee S. and Walters A.. Programming the functions of formal logic, II . Notre Dame journal of formal logic, vol. 4 no. 4 , pp. 293–305. [REVIEW]Alan Rose - 1970 - Journal of Symbolic Logic 35 (4):596-597.
Michael Anderson. Note on the mortality problem for shift state trees. Notre Dame journal of formal logic, vol. 10 no. 3 , pp. 275–276. [REVIEW]Philip K. Hooper - 1971 - Journal of Symbolic Logic 36 (1):151.
Philip K. Hooper. The undecidability of the Turing machine immortality problem. The journal of symbolic logic, vol. 31 , pp. 219–234. [REVIEW]Gabor T. Herman - 1971 - Journal of Symbolic Logic 36 (1):150-150.
McCall Storrs. A simple decision procedure for one-variable implication/negation formulae in intuitionist logic. Notre Dame journal of formal logic, vol. 3 , pp. 120–122. [REVIEW]Gene F. Rose - 1964 - Journal of Symbolic Logic 29 (4):212-213.
Cresswell M. J.. A Henkin completeness theorem for T. Notre Dame journal of formal logic, vol. 8 no. 3 , pp. 186–190.Cresswell M. J.. Alternative completeness theorems for modal systems. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 339–345.Cresswell M. J.. Some proofs of relative completeness in modal logic. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 62–66. [REVIEW]David Makinson - 1970 - Journal of Symbolic Logic 35 (4):581-582.
Ashworth E. J.. Propositional logic in the sixteenth and early seventeenth centuries. Notre Dame journal of formal logic, vol. 9 no. 2 , pp. 179–192.Ashworth E. J.. Petrus Fonseca and material implication. Notre Dame journal of formal logic, vol. 9 no. 3 , pp. 227–228. [REVIEW]Martin M. Tweedale - 1971 - Journal of Symbolic Logic 36 (2):323-324.

Analytics

Added to PP
2013-11-03

Downloads
53 (#409,721)

6 months
12 (#298,890)

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