Book Volume 6300 2010

Fields of Logic and Computation

Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday

Editors:

ISBN: 978-3-642-15024-1 (Print) 978-3-642-15025-8 (Online)

Table of contents (30 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. On Yuri Gurevich

    1. No Access

      Chapter

      Pages 1-48

      Yuri, Logic, and Computer Science

    2. No Access

      Chapter

      Pages 49-60

      Database Theory, Yuri, and Me

  3. Technical Papers

    1. No Access

      Chapter

      Pages 61-74

      Tracking Evidence

    2. No Access

      Chapter

      Pages 75-94

      Strict Canonical Constructive Systems

    3. No Access

      Chapter

      Pages 95-107

      Decidable Expansions of Labelled Linear Orderings

    4. No Access

      Chapter

      Pages 108-134

      Existential Fixed-Point Logic, Universal Quantifiers, and Topoi

    5. No Access

      Chapter

      Pages 135-146

      Three Paths to Effectiveness

    6. No Access

      Chapter

      Pages 147-164

      The Quest for a Tight Translation of Büchi to co-Büchi Automata

    7. No Access

      Chapter

      Pages 165-180

      Normalization of Some Extended Abstract State Machines

    8. No Access

      Chapter

      Pages 181-200

      Finding Reductions Automatically

    9. No Access

      Chapter

      Pages 201-207

      On Complete Problems, Relativizations and Logics for Complexity Classes

    10. No Access

      Chapter

      Pages 208-226

      Effective Closed Subshifts in 1D Can Be Implemented in 2D

    11. No Access

      Chapter

      Pages 227-250

      The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey

    12. No Access

      Chapter

      Pages 251-276

      A Logic for PTIME and a Parameterized Halting Problem

    13. No Access

      Chapter

      Pages 277-300

      Inferring Loop Invariants Using Postconditions

    14. No Access

      Chapter

      Pages 301-327

      ASMs and Operational Algorithmic Completeness of Lambda Calculus

    15. No Access

      Chapter

      Pages 328-353

      Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs

    16. No Access

      Chapter

      Pages 354-404

      Ibn Sīnā on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of Logic

    17. No Access

      Chapter

      Pages 405-413

      Abstract State Machines and the Inquiry Process

    18. No Access

      Chapter

      Pages 414-443

      The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion

previous Page of 2