Approximation to a decision procedure for the halting problem

Notre Dame Journal of Formal Logic 9 (4):305-312 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093893516

Other Versions

reprint Anderson, Michael (1970) "Approximation to a Decision Procedure for the Halting Problem". Journal of Symbolic Logic 35(3):480-480

Links

PhilArchive



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

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: Michael Anderson, Approximation to a Decision Procedure for the Halting Problem. [REVIEW]Philip K. Hooper - 1970 - Journal of Symbolic Logic 35 (3):480-480.
Michael Anderson. Approximation to a decision procedure for the halting problem. Notre Dame journal of formal logic, vol. 9 no. 4 , pp. 305–312. [REVIEW]Philip K. Hooper - 1970 - Journal of Symbolic Logic 35 (3):480.
The halting problem is almost always decidable.Joel David Hamkins & Alexei Miasnikov - 2006 - Notre Dame Journal of Formal Logic 47 (4):515-524.
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.
A decision procedure for positive implication.Michael D. Resnik - 1962 - Notre Dame Journal of Formal Logic 3 (3):179-186.
The Halting Problem Is Decidable on a Set of Asymptotic Probability One.Joel David Hamkins & Alexei Miasnikov - 2006 - Notre Dame Journal of Formal Logic 47 (4):515-524.
A decision procedure for Fitch's propositional calculus.Richmond H. Thomason - 1967 - Notre Dame Journal of Formal Logic 8 (1-2):101-117.
A simplified decision procedure for categorical syllogisms.Harry J. Gensler - 1973 - Notre Dame Journal of Formal Logic 14 (4):457-466.
A matrix decision procedure for three modal logics.Adrian Larner - 1979 - Notre Dame Journal of Formal Logic 20 (3):599-602.

Analytics

Added to PP
2010-08-24

Downloads
36 (#629,586)

6 months
10 (#413,587)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computable Diagonalizations and Turing’s Cardinality Paradox.Dale Jacquette - 2014 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 45 (2):239-262.

Add more citations

References found in this work

No references found.

Add more references