Table of contents

  1. Front Matter
  2. Stuart A. Kurtz, John C. Mitchell, Michael J. O'Donnell
    Pages 1-21
  3. Maria Napierala
    Pages 89-107
  4. Vipin Swarup, Uday S. Reddy
    Pages 131-149
  5. Michael R. Fellows, Michael A. Langston
    Pages 150-158
  6. Thierry Coquand
    Pages 159-164
  7. Jawahar Chirimar, Douglas J. Howe
    Pages 165-178
  8. J. V. Tucker, J. I. Zucker
    Pages 179-198
  9. J. Paul Myers Jr., Ronald E. Prather
    Pages 218-227
  10. Back Matter

About these proceedings


Mathematicians have long recognized the distinction between an argument showing that an interesting object exists and a procedure for actually constructing the object. Computer science adds a new dimension of interest in constructivity, since a computer program is a formal description of a constructive procedure that can be executed automatically. It has beenover a decade since a conference was devoted to constructivity, and never before has one been held specifically relating computer science to constructivity. Thus, this proceedings volume is the most concentrated offering ever produced of the diverse ways in which constructivity and computer science are related. The papers cover semantics and type theory, logic and theorem proving, real and complex analysis, topology and combinatorics, nonconstructive graph-theoretical techniques, and curriculum and pedagogic issues. The book offers a concentrated view of the many ways in which constructivity has assumed importance in computer science, and contains results available nowhere else.


Automat computer computer science logic proving semantics theorem proving

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1992
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-55631-2
  • Online ISBN 978-3-540-47265-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site