The Computational Complexity of Logical Theories

Springer Verlag (1979)
Abstract
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.55 used (45% off)   $117.54 new (27% off)   $127.20 direct from Amazon (20% off)    Amazon page
Call number QA9.35.L28 no. 718
ISBN(s) 0387095012   9780387095011  
DOI 10.2307/2274206
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,178
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.
Dominoes and the Complexity of Subclasses of Logical Theories.Erich Grädel - 1989 - Annals of Pure and Applied Logic 43 (1):1-30.
Stationary Logic of Ordinals.Alan H. Mekler - 1984 - Annals of Pure and Applied Logic 26 (1):47-68.

View all 9 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.
The Complexity of Propositional Proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
Computational Vs. Causal Complexity.Matthias Scheutz - 2001 - Minds and Machines 11 (4):543-566.
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.
Complete Problems in the First-Order Predicate Calculus.David A. Plaisted - 1979 - Dept. Of Computer Science, University of Illinois at Urbana-Champaign.

Monthly downloads

Added to index

2009-01-28

Total downloads

30 ( #169,977 of 2,163,689 )

Recent downloads (6 months)

1 ( #348,043 of 2,163,689 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums