Computational Complexity and the Universal Acceptance of Logic

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

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

ISBN(s)

0022362X

DOI

10.2307/2026030

Links

PhilArchive



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

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

Computational complexity and the universal acceptance of logic.Christopher Cherniak - 1984 - Journal of Philosophy 81 (12):739-758.
Logic and Computational Complexity International Workshop Lcc '94, Indianapolis, in, Usa, October 13-16, 1994 : Selected Papers'.Daniel Leivant - 1995 - Springer Verlag.
Computational model theory: an overview.M. Vardi - 1998 - Logic Journal of the IGPL 6 (4):601-624.
Computation models for parameterized complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.
The Computational Complexity of Quantified Reciprocals.Jakub Szymanik - 2009 - In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
Coherence and Computational Complexity of Quantifier-free Dependence Logic Formulas.Jarmo Kontinen - 2013 - Studia Logica 101 (2):267-291.
Organizations as Universal Computing Machines: Rule Systems, Computational Equivalence, and Organizational Complexity.Mihnea Moldoveanu - 2008 - Emergence: Complexity and Organization 10 (1).
The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.
Elementary arithmetic.Geoffrey E. Ostrin & Stanley S. Wainer - 2005 - Annals of Pure and Applied Logic 133 (1):275-292.
Logic and Complexity.Richard Lassaigne & Michel de Rougemont - 2012 - Springer Verlag.
On the Capture of Complexity Classes Using Logic.I. A. Stewart - 1991 - University of Newcastle Upon Tyne, Computing Laboratory.
Finite Automata, Formal Logic, and Circuit Complexity.Howard Straubing - 1994 - Birkhäuser.
A modal perspective on the computational complexity of attribute value grammar.Patrick Blackburn & Edith Spaan - 1993 - Journal of Logic, Language and Information 2 (2):129-169.
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.
Generic separations and leaf languages.M. Galota, H. Vollmer & S. Kosub - 2003 - Mathematical Logic Quarterly 49 (4):353.

Analytics

Added to PP
2016-06-30

Downloads
17 (#891,762)

6 months
6 (#581,938)

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.
A model theoretic approach to 'natural' reasoning.Newton C. A. da Costa & Steven French - 1993 - International Studies in the Philosophy of Science 7 (2):177-190.
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.
Computational Tractability and Conceptual Coherence.Paul Thagard - 1993 - Canadian Journal of Philosophy 23 (3):349-363.

View all 18 citations / Add more citations

References found in this work

No references found.

Add more references