Computational complexity and the universal acceptance of logic

Journal of Philosophy 81 (12):739-758 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
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.
The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.
The extent of computation in malament–hogarth spacetimes.P. D. Welch - 2008 - British Journal for the Philosophy of Science 59 (4):659-674.

Analytics

Added to PP
2009-01-28

Downloads
97 (#178,110)

6 months
12 (#213,237)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Truth in Fiction: Rethinking its Logic.John Woods - 2018 - Cham, Switzerland: Springer Verlag.
Keeping ‘True’: A Case Study in Conceptual Ethics.Alexis Burgess - 2014 - Inquiry: An Interdisciplinary Journal of Philosophy 57 (5-6):580-606.
Incoherentism and the Sorites Paradox.Matti Eklund - 2019 - In Sergi Oms & Elia Zardini (eds.), The Sorites Paradox. New York, NY: Cambridge University Press.

View all 14 citations / Add more citations

References found in this work

No references found.

Add more references