Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Logic from Computer Science

Proceedings of a Workshop held November 13–17, 1989

  • Conference proceedings
  • © 1992

Overview

Editors:
  1. Yiannis N. Moschovakis

    1. Department of Mathematics, University of California at Los Angeles, Los Angeles, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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 (22 papers)

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. The Imperative Future: Past Successes ⇒ Future Actions

    • Howard Barringer, Dov Gabbay
    Pages 1-16

  3. A Logical Operational Semantics of Full Prolog: Part III. Built-In Predicates for Files, Terms, Arithmetic and Input-Output

    • Egon Börger
    Pages 17-50

  4. Computability and Complexity of Higher Type Functions

    • Stephen A. Cook
    Pages 51-72

  5. Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transformations

    • Roberto Di Cosmo, Giuseppe Longo
    Pages 73-94

  6. Logics for Termination and Correctness of Functional Programs

    • Solomon Feferman
    Pages 95-127

  7. Transparent Grammars

    • Kit Fine
    Pages 129-151

  8. Designing Unification Procedures Using Transformations: A Survey

    • Jean H. Gallier, Wayne Snyder
    Pages 153-215

  9. Normal Forms and Cut-Free Proofs as Natural Transformations

    • Jean-Yves Girard, Andre Scedrov, Philip J. Scott
    Pages 217-241

  10. Computer Implementation and Applications of Kleene’s S-M-N and Recursion Theorems

    • Neil D. Jones
    Pages 243-263

  11. 0–1 Laws for Fragments of Second-Order Logic: An Overview

    • Phokion G. Kolaitis, Moshe Y. Vardi
    Pages 265-286

  12. No Counter-Example Interpretation and Interactive Computation

    • Jan Krajíček
    Pages 287-293

  13. Semantic Characterizations of Number Theories

    • Daniel Leivant
    Pages 295-317

  14. Constructive Kripke Semantics and Realizability

    • James Lipton
    Pages 319-357

  15. Splitting and Density for the Recursive Sets of a Fixed Time Complexity

    • Wolfgang Maass, Theodore A. Slaman
    Pages 359-372

  16. Reals and Forcing with an Elementary Topos

    • Saunders Mac Lane, Ieke Moerdijk
    Pages 373-385

  17. Completeness Theorems for Logics of Feature Structures

    • Lawrence S. Moss
    Pages 387-403

  18. Concurrent Programs as Strategies in Games

    • Anil Nerode, Alexander Yakhnis, Vladimir Yakhnis
    Pages 405-479

  19. Finite and Infinite Dialogues

    • Rohit Parikh
    Pages 481-497

  20. Some Relations Between Subsystems of Arithmetic and Complexity of Computations

    • Pavel Pudlák
    Pages 499-519
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Department of Mathematics, University of California at Los Angeles, Los Angeles, USA

    Yiannis N. Moschovakis

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation