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 $8.03 used (96% off)   $8.57 new (96% off)   $129.43 direct from Amazon (28% off)    Amazon page
Call number QA9.35.L28 no. 718
ISBN(s) 0387095012   9780387095011  
DOI 10.2307/2274206
 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
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,904
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
Françoise Maurin (1997). Ehrenfeucht Games and Ordinal Addition. Annals of Pure and Applied Logic 89 (1):53-73.

View all 10 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

22 ( #130,557 of 1,725,560 )

Recent downloads (6 months)

4 ( #167,283 of 1,725,560 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.