Skip to main content
SpringerLink
Log in
Book cover

Computational Logic

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. Ulrich Berger

    1. Department of Mathematics, University of Munich, Munich, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Helmut Schwichtenberg

    1. Department of Mathematics, University of Munich, Munich, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • World-class research on the interplay of mathematical logic and computer science
  • High-level introduction to proof-theoretic and semantic foundations of programming concepts
  • The latest in a renowned series of Marktoberdorf Summer School volumes on computational logic

Part of the book series: NATO ASI Subseries F: (NATO ASI F, volume 165)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (11 papers)

  1. Front Matter

    Pages i-vii
    Download chapter PDF

  2. Game Semantics

    • Samson Abramsky, Guy McCusker
    Pages 1-55

  3. Notes on the Simply Typed Lambda Calculus

    • Peter Aczel
    Pages 57-97

  4. Problems in Type Theory

    • Henk Barendregt
    Pages 99-111

  5. Formal Correctness Proofs of Functional Programs: Dijkstra’s Algorithm, a Case Study

    • Holger Benl, Helmut Schwichtenberg
    Pages 113-126

  6. Propositional Proof Complexity an Introduction

    • Samuel R. Buss
    Pages 127-178

  7. Formalizing Decidability Theorems About Automata

    • Robert L. Constable
    Pages 179-213

  8. On the Meaning of Logical Rules I: Syntax Versus Semantics

    • Jean-Yves Girard
    Pages 215-272

  9. Complexity of Primitive Recursion

    • W. G. Handley, S. S. Wainer
    Pages 273-300

  10. Computers, Reasoning and Mathematical Practice

    • Ursula Martin
    Pages 301-346

  11. Research Directions in Rewriting Logic

    • José Meseguer
    Pages 347-398

  12. Sequent Calculus and the Specification of Computation

    • Dale Miller
    Pages 399-444

  13. Back Matter

    Pages 445-448
    Download chapter PDF
Back to top

Keywords

About this book

Recent developments in computer science clearly show the need for a better theoretical foundation for some central issues. Methods and results from mathematical logic, in particular proof theory and model theory, are of great help here and will be used much more in future than previously. This book provides an excellent introduction to the interplay of mathematical logic and computer science. It contains extensively reworked versions of the lectures given at the 1997 Marktoberdorf Summer School by leading researchers in the field.
Topics covered include: proof theory and specification of computation (J.-Y. Girard, D. Miller), complexity of proofs and programs (S. R. Buss, S. S. Wainer), computational content of proofs (H. Schwichtenberg), constructive type theory (P. Aczel, H. Barendregt, R. L. Constable), computational mathematics, (U. Martin), rewriting logic (J. Meseguer), and game semantics (S. Abramski).

Editors and Affiliations

  • Department of Mathematics, University of Munich, Munich, Germany

    Ulrich Berger, Helmut Schwichtenberg

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation