Book 1987

Mathematical Logic and Its Applications

Editors:

ISBN: 978-1-4612-8234-1 (Print) 978-1-4613-0897-3 (Online)

Table of contents (27 chapters)

previous Page of 2
  1. Front Matter

    Pages i-xiv

  2. Gödel Session

    1. Front Matter

      Pages 1-1

    2. No Access

      Chapter

      Pages 3-7

      Remarks Concerning Kurt Gödel’s Life and Work

    3. No Access

      Chapter

      Pages 9-21

      Facets of Incompleteness

    4. No Access

      Chapter

      Pages 23-36

      Godel’s Life and Work

  3. Summer School

    1. Front Matter

      Pages 37-37

    2. No Access

      Chapter

      Pages 39-60

      Categorial Grammar and Lambda Calculus

    3. No Access

      Chapter

      Pages 61-79

      A Constructive Morse Theory of Sets

    4. No Access

      Chapter

      Pages 81-106

      Differentiation of Constructive Functions of a Real Variable and Relative Computability

    5. No Access

      Chapter

      Pages 107-124

      A Completeness Theorem for Higher-Order Intuitionistic Logic: An Intuitionistic Proof

    6. No Access

      Chapter

      Pages 125-135

      Reasoning in Trees

    7. No Access

      Chapter

      Pages 137-147

      Non-Deterministic Program Schemata and Their Relation to Dynamic Logic

    8. No Access

      Chapter

      Pages 149-165

      The Parallel Evaluation of Functional Programs

    9. No Access

      Chapter

      Pages 167-186

      Logic Approximating Sequences of Sets

    10. No Access

      Chapter

      Pages 187-204

      Intuitionistic Formal Spaces — A First Communication

    11. No Access

      Chapter

      Pages 205-211

      On the Logic of Small Changes in Theories II

    12. No Access

      Chapter

      Pages 213-229

      On ‘Logical Relations’ in Program Semantics

  4. Conference

    1. Front Matter

      Pages 231-231

    2. No Access

      Chapter

      Pages 233-242

      Search Computability and Computability with Numberings Are Equivalent in the Case of Finite Set of Objects

    3. No Access

      Chapter

      Pages 243-251

      Cut-Elimination Theorem for Higher-Order Classical Logic: An Intuitionistic Proof

    4. No Access

      Chapter

      Pages 253-263

      Modal Environment for Boolean Speculations

    5. No Access

      Chapter

      Pages 265-272

      Distributive Spaces

    6. No Access

      Chapter

      Pages 273-282

      Approximating the Projective Model

    7. No Access

      Chapter

      Pages 283-292

      Projection Complete Graph Problems Corresponding to a Branching-Program-Based Characterization of the Complexity Classes NC 1 ,Land NL

previous Page of 2