Some upper and lower bounds on decision procedures in logic

Cambridge: Project MAC, Massachusetts Institute of Technology (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Call number

QA9.65.F47

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,471

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

On the complexity of the theories of weak direct powers.Charles Rackoff - 1976 - Journal of Symbolic Logic 41 (3):561-573.
Computational complexity and Godel's incompleteness theorem. McGraw-Hill - unknown
The church-Turing thesis and effective mundane procedures.Leon Horsten - 1995 - Minds and Machines 5 (1):1-8.
Reflections on gödel's and Gandy's reflections on Turing's thesis.David Israel - 2002 - Minds and Machines 12 (2):181-201.
The scope of Turing's analysis of effective procedures.Jeremy Seligman - 2002 - Minds and Machines 12 (2):203-220.
Godel's theorem, church's theorem, and mechanism.J. J. C. Smart - 1961 - Synthese 13 (1):105-10.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Edgar Morin's paradigm of complexity and gödel's incompleteness theorem.Yi-Zhuang Chen - 2004 - World Futures 60 (5 & 6):421 – 431.
Computational complexity and Godel's incompleteness theorem.Gregory J. Chaitin - 1970 - [Rio de Janeiro,: Centro Técnico Científico, Pontifícia Universidade Católica do Rio de Janeiro. Edited by Gregory J. Chaitin.
More about uniform upper Bounds on ideals of Turing degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.

Analytics

Added to PP
2009-01-28

Downloads
2 (#1,809,379)

6 months
2 (#1,206,545)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references