↓ Skip to main content

Computer Science Logic

Overview of attention for book
Cover of 'Computer Science Logic'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Algebra for Tree Languages
  3. Altmetric Badge
    Chapter 2 Forcing and Type Theory
  4. Altmetric Badge
    Chapter 3 Functional Interpretations of Intuitionistic Linear Logic
  5. Altmetric Badge
    Chapter 4 Fixed-Point Definability and Polynomial Time
  6. Altmetric Badge
    Chapter 5 Kleene’s Amazing Second Recursion Theorem
  7. Altmetric Badge
    Chapter 6 Typed Applicative Structures and Normalization by Evaluation for System F ω
  8. Altmetric Badge
    Chapter 7 Jumping Boxes
  9. Altmetric Badge
    Chapter 8 Tree-Width for First Order Formulae
  10. Altmetric Badge
    Chapter 9 Algorithmic Analysis of Array-Accessing Programs
  11. Altmetric Badge
    Chapter 10 Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
  12. Altmetric Badge
    Chapter 11 Cardinality Quantifiers in MLO over Trees
  13. Altmetric Badge
    Chapter 12 From Coinductive Proofs to Exact Real Arithmetic
  14. Altmetric Badge
    Chapter 13 On the Relation between Sized-Types Based Termination and Semantic Labelling
  15. Altmetric Badge
    Chapter 14 Expanding the Realm of Systematic Proof Theory
  16. Altmetric Badge
    Chapter 15 EXPTIME Tableaux for the Coalgebraic μ -Calculus
  17. Altmetric Badge
    Chapter 16 On the Word Problem for ${\it \Sigma\Pi}$ -Categories, and the Properties of Two-Way Communication
  18. Altmetric Badge
    Chapter 17 Intersection, Universally Quantified, and Reference Types
  19. Altmetric Badge
    Chapter 18 Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
  20. Altmetric Badge
    Chapter 19 Enriching an Effect Calculus with Linear Types
  21. Altmetric Badge
    Chapter 20 Degrees of Undecidability in Term Rewriting
  22. Altmetric Badge
    Chapter 21 Upper Bounds on Stream I/O Using Semantic Interpretations
  23. Altmetric Badge
    Chapter 22 Craig Interpolation for Linear Temporal Languages
  24. Altmetric Badge
    Chapter 23 On Model Checking Boolean BI
  25. Altmetric Badge
    Chapter 24 Efficient Type-Checking for Amortised Heap-Space Analysis
  26. Altmetric Badge
    Chapter 25 Deciding the Inductive Validity of ∀ ∃  * Queries
  27. Altmetric Badge
    Chapter 26 On the Parameterised Intractability of Monadic Second-Order Logic
  28. Altmetric Badge
    Chapter 27 Automatic Structures of Bounded Degree Revisited
  29. Altmetric Badge
    Chapter 28 Nondeterminism and Observable Sequentiality
  30. Altmetric Badge
    Chapter 29 A Decidable Spatial Logic with Cone-Shaped Cardinal Directions
  31. Altmetric Badge
    Chapter 30 Focalisation and Classical Realisability
  32. Altmetric Badge
    Chapter 31 Decidable Extensions of Church’s Problem
  33. Altmetric Badge
    Chapter 32 Nested Hoare Triples and Frame Rules for Higher-Order Store
  34. Altmetric Badge
    Chapter 33 A Complete Characterization of Observational Equivalence in Polymorphic λ -Calculus with General References
  35. Altmetric Badge
    Chapter 34 Non-Commutative First-Order Sequent Calculus
  36. Altmetric Badge
    Chapter 35 Model Checking FO (R) over One-Counter Processes and beyond
  37. Altmetric Badge
    Chapter 36 Confluence of Pure Differential Nets with Promotion
  38. Altmetric Badge
    Chapter 37 Computer Science Logic
  39. Altmetric Badge
    Chapter 38 On the Complexity of Branching-Time Logics
  40. Altmetric Badge
    Chapter 39 Nominal Domain Theory for Concurrency
  41. Altmetric Badge
    Chapter 40 The Ackermann Award 2009
Attention for Chapter 5: Kleene’s Amazing Second Recursion Theorem
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
4 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.
Chapter title
Kleene’s Amazing Second Recursion Theorem
Chapter number 5
Book title
Computer Science Logic
Published by
Springer, Berlin, Heidelberg, September 2009
DOI 10.1007/978-3-642-04027-6_5
Book ISBNs
978-3-64-204026-9, 978-3-64-204027-6
Authors

Yiannis N. Moschovakis

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 2 50%
Professor > Associate Professor 1 25%
Professor 1 25%
Readers by discipline Count As %
Computer Science 4 100%