The Computational Complexity of Logical Theories

Springer Verlag (1979)

This book asks not only how the study of white-collar crime can enrich our understanding of crime and justice more generally, but also how criminological ...
Keywords Predicate calculus  Computational complexity
Categories (categorize this paper)
Buy the book $88.77 used (45% off)   $97.88 new (39% off)   $134.90 direct from Amazon (16% off)    Amazon page
Call number QA9.35.L28 no. 718
ISBN(s) 0387095012   9780387095011  
DOI 10.2307/2274206
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 46,223
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Pairs, Sets and Sequences in First-Order Theories.Albert Visser - 2008 - Archive for Mathematical Logic 47 (4):299-326.
Vaught's Theorem on Axiomatizability by a Scheme.Albert Visser - 2012 - Bulletin of Symbolic Logic 18 (3):382-402.
Dominoes and the Complexity of Subclasses of Logical Theories.Erich Grädel - 1989 - Annals of Pure and Applied Logic 43 (1):1-30.

View all 12 citations / Add more citations

Similar books and articles

Deterministic Chaos and Computational Complexity: The Case of Methodological Complexity Reductions. [REVIEW]Theodor Leiber - 1999 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 30 (1):87-101.
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.
Computational Vs. Causal Complexity.Matthias Scheutz - 2001 - Minds and Machines 11 (4):543-566.
The Complexity of Propositional Proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
Complete Problems in the First-Order Predicate Calculus.David A. Plaisted - 1979 - Dept. Of Computer Science, University of Illinois at Urbana-Champaign.


Added to PP index

Total views
45 ( #197,587 of 2,285,692 )

Recent downloads (6 months)
1 ( #837,842 of 2,285,692 )

How can I increase my downloads?


My notes

Sign in to use this feature