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)

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

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.
A decision procedure for positive implication.Michael D. Resnik - 1962 - Notre Dame Journal of Formal Logic 3 (3):179-186.
The halting problem is almost always decidable.Joel David Hamkins & Alexei Miasnikov - 2006 - Notre Dame Journal of Formal Logic 47 (4):515-524.
Note on the mortality problem for shift state trees.Michael Anderson - 1969 - Notre Dame Journal of Formal Logic 10 (3):275-276.
A decision procedure for Fitch's propositional calculus.Richmond H. Thomason - 1967 - Notre Dame Journal of Formal Logic 8 (1-2):101-117.
A matrix decision procedure for three modal logics.Adrian Larner - 1979 - Notre Dame Journal of Formal Logic 20 (3):599-602.
A simplified decision procedure for categorical syllogisms.Harry J. Gensler - 1973 - Notre Dame Journal of Formal Logic 14 (4):457-466.

Analytics

Added to PP
2016-06-30

Downloads
22 (#690,757)

6 months
1 (#1,510,037)

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