The Computational Complexity of Logical Theories

Journal of Symbolic Logic 49 (2):670-671 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274206

Links

PhilArchive



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

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: Jeanne Ferrante, Charles W. Rackoff, The Computational Complexity of Logical Theories. [REVIEW]Dirk Siefkes - 1984 - Journal of Symbolic Logic 49 (2):670-671.
Ferrante Jeanne and Rackoff Charles W.. The computational complexity of logical theories. Lecture notes in mathematics, vol. 718. Springer-Verlag, Berlin, Heidelberg, and New York, 1979, X + 243 pp. [REVIEW]Dirk Siefkes - 1984 - Journal of Symbolic Logic 49 (2):670-671.
The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.
Computational complexity of logical theories of one successor and another unary function.Pascal Michel - 2007 - Archive for Mathematical Logic 46 (2):123-148.
A uniform method for proving lower bounds on the computational complexity of logical theories.Kevin J. Compton & C. Ward Henson - 1990 - Annals of Pure and Applied Logic 48 (1):1.
Elementary arithmetic.Geoffrey E. Ostrin & Stanley S. Wainer - 2005 - Annals of Pure and Applied Logic 133 (1):275-292.
Review: Anna R. Bruss, Albert R. Meyer, On Time-Space Classes and their Relation to the Theory of Real Addition; Leonard Berman, The Complexity of Logical Theories; Hugo Volger, Turing Machines with Linear Alternation, Theories of Bounded Concatenation. [REVIEW]Charles Rackoff - 1986 - Journal of Symbolic Logic 51 (3):817-818.
Computational model theory: an overview.M. Vardi - 1998 - Logic Journal of the IGPL 6 (4):601-624.
Why philosophers should care about computational complexity.Scott Aaronson - 2013 - Computability: Turing, Gödel, Church, and Beyond:261--328.
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.
Quantifiers and Cognition: Logical and Computational Perspectives.Jakub Szymanik - 2016 - Springer.
Some decision problems of enormous complexity.Harvey Friedman - manuscript
On the nature and origin of complexity in discrete, homogeneous, locally-interacting systems.Charles H. Bennett - 1986 - Foundations of Physics 16 (6):585-592.
Some upper and lower bounds on decision procedures in logic.Jeanne Ferrante - 1974 - Cambridge: Project MAC, Massachusetts Institute of Technology.
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.

Analytics

Added to PP
2017-02-21

Downloads
1 (#1,898,626)

6 months
1 (#1,461,875)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

First-Order Formulas in Conjunctive Quantificational Form.Hans Kleine Büning & Theodor Lettmann - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (1):53-64.
Locality and modular Ehrenfeucht–Fraïssé games.Achim Blumensath - 2012 - Journal of Applied Logic 10 (1):144-162.
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers.Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas & Felix Weiß - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 261-278.

Add more citations

References found in this work

No references found.

Add more references