Logic from Computer Science

Proceedings of a Workshop held November 13–17, 1989

  • Yiannis N. Moschovakis
Conference proceedings

Part of the Mathematical Sciences Research Institute Publications book series (MSRI, volume 21)

Table of contents

  1. Front Matter
    Pages i-xi
  2. Howard Barringer, Dov Gabbay
    Pages 1-16
  3. Kit Fine
    Pages 129-151
  4. Jean H. Gallier, Wayne Snyder
    Pages 153-215
  5. Jean-Yves Girard, Andre Scedrov, Philip J. Scott
    Pages 217-241
  6. Phokion G. Kolaitis, Moshe Y. Vardi
    Pages 265-286
  7. Daniel Leivant
    Pages 295-317
  8. Wolfgang Maass, Theodore A. Slaman
    Pages 359-372
  9. Saunders Mac Lane, Ieke Moerdijk
    Pages 373-385
  10. Anil Nerode, Alexander Yakhnis, Vladimir Yakhnis
    Pages 405-479
  11. Rohit Parikh
    Pages 481-497
  12. J. C. Shepherdson
    Pages 521-583
  13. Rick Statman
    Pages 585-596

About these proceedings


The volume is the outgrowth of a workshop with the same title held at MSRI in the week of November 13-17, 1989, and for those who did not get it, Logic from Computer Science is the converse of Logic in Computer Science, the full name of the highly successful annual LICS conferences. We meant to have a conference which would bring together the LICS commu­ nity with some of the more traditional "mathematical logicians" and where the emphasis would be on the flow of ideas from computer science to logic rather than the other way around. In a LICS talk, sometimes, the speaker presents a perfectly good theorem about (say) the A-calculus or finite model theory in terms of its potential applications rather than its (often more ob­ vious) intrinsic, foundational interest and intricate proof. This is not meant to be a criticism; the LICS meetings are, after all, organized by the IEEE Computer Society. We thought, for once, it would be fun to see what we would get if we asked the speakers to emphasize the relevance of their work for logic rather than computer science and to point out what is involved in the proofs. I think, mostly, it worked. In any case, the group of people represented as broad a selection of logicians as I have seen in recent years, and the quality of the talks was (in my view) exceptionally, unusually high. I learned a lot and (I think) others did too.


complexity forcing grammars logic proof semantics

Editors and affiliations

  • Yiannis N. Moschovakis
    • 1
  1. 1.Department of MathematicsUniversity of California at Los AngelesLos AngelesUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag New York 1992
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-7685-2
  • Online ISBN 978-1-4612-2822-6
  • Series Print ISSN 0940-4740
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking