↓ Skip to main content

Logic and Computational Complexity

Overview of attention for book
Cover of 'Logic and Computational Complexity'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 76 Strict finitism and feasibility
  3. Altmetric Badge
    Chapter 77 Logical omniscience
  4. Altmetric Badge
    Chapter 78 On feasible numbers
  5. Altmetric Badge
    Chapter 79 On parallel hierarchies and R k i
  6. Altmetric Badge
    Chapter 80 Program extraction from classical proofs
  7. Altmetric Badge
    Chapter 81 Computation models and function algebras
  8. Altmetric Badge
    Chapter 82 Expressing computational complexity in constructive type theory
  9. Altmetric Badge
    Chapter 83 Light linear logic
  10. Altmetric Badge
    Chapter 84 Intrinsic theories and computational complexity
  11. Altmetric Badge
    Chapter 85 On Herbrand's theorem
  12. Altmetric Badge
    Chapter 86 Some consequences of cryptographical conjectures for S 2 1 and EF
  13. Altmetric Badge
    Chapter 87 Frege proof system and TNC °
  14. Altmetric Badge
    Chapter 88 Characterizing parallel time by type 2 recursions with polynomial output length
  15. Altmetric Badge
    Chapter 89 Type 2 polynomial hierarchies
  16. Altmetric Badge
    Chapter 90 The hierarchy of terminating recursive programs over N
  17. Altmetric Badge
    Chapter 91 Feasibly categorical models
  18. Altmetric Badge
    Chapter 92 Metafinite model theory
  19. Altmetric Badge
    Chapter 93 Automatic presentations of structures
  20. Altmetric Badge
    Chapter 94 A restricted second order logic for finite structures
  21. Altmetric Badge
    Chapter 95 Comparing the power of monadic NP games
  22. Altmetric Badge
    Chapter 96 Linear constraint query languages expressive power and complexity
  23. Altmetric Badge
    Chapter 97 A constant-space sequential model of computation for first-order logic
  24. Altmetric Badge
    Chapter 98 Logics capturing relativized complexity classes uniformly
  25. Altmetric Badge
    Chapter 99 Preservation theorems in finite model theory
  26. Altmetric Badge
    Chapter 100 A query language for NC (extended abstract)
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
4 X users
wikipedia
7 Wikipedia pages
googleplus
3 Google+ users

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
16 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Logic and Computational Complexity
Published by
Springer Berlin Heidelberg, January 2006
DOI 10.1007/3-540-60178-3
ISBNs
978-3-54-060178-4, 978-3-54-044720-7
Editors

Leivant, Daniel

X Demographics

X Demographics

The data shown below were collected from the profiles of 4 X users who shared this research output. Click here to find out more about how the information was compiled.