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 $105.41 new (30% off)   $105.46 used (30% off)   $132.75 direct from Amazon (11% off)    Amazon page
Call number QA9.35.L28 no. 718
ISBN(s) 0387095012   9780387095011
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
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,357
External links
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA
    Alan H. Mekler (1984). Stationary Logic of Ordinals. Annals of Pure and Applied Logic 26 (1):47-68.

    View all 6 citations

    Similar books and articles
    Gregory J. Chaitin (1970). Computational Complexity and Godel's Incompleteness Theorem. [Rio De Janeiro,Centro Técnico Científico, Pontifícia Universidade Católica Do Rio De Janeiro.
    Nathan Segerlind (2007). The Complexity of Propositional Proofs. Bulletin of Symbolic Logic 13 (4):417-481.
    David A. Plaisted (1979). Complete Problems in the First-Order Predicate Calculus. Dept. Of Computer Science, University of Illinois at Urbana-Champaign.
    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    11 ( #112,987 of 1,088,777 )

    Recent downloads (6 months)

    1 ( #69,666 of 1,088,777 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


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