↓ Skip to main content
What is this page? Embed badge

Logic from Computer Science : Proceedings of a Workshop held November 13–17, 1989

Overview of attention for book
Cover of 'Logic from Computer Science : Proceedings of a Workshop held November 13–17, 1989'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Imperative Future: Past Successes ⇒ Future Actions
  3. Altmetric Badge
    Chapter 2 A Logical Operational Semantics of Full Prolog: Part III. Built-In Predicates for Files, Terms, Arithmetic and Input-Output
  4. Altmetric Badge
    Chapter 3 Computability and Complexity of Higher Type Functions
  5. Altmetric Badge
    Chapter 4 Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transformations
  6. Altmetric Badge
    Chapter 5 Logics for Termination and Correctness of Functional Programs
  7. Altmetric Badge
    Chapter 6 Transparent Grammars
  8. Altmetric Badge
    Chapter 7 Designing Unification Procedures Using Transformations: A Survey
  9. Altmetric Badge
    Chapter 8 Normal Forms and Cut-Free Proofs as Natural Transformations
  10. Altmetric Badge
    Chapter 9 Computer Implementation and Applications of Kleene’s S-M-N and Recursion Theorems
  11. Altmetric Badge
    Chapter 10 0–1 Laws for Fragments of Second-Order Logic: An Overview
  12. Altmetric Badge
    Chapter 11 No Counter-Example Interpretation and Interactive Computation
  13. Altmetric Badge
    Chapter 12 Semantic Characterizations of Number Theories
  14. Altmetric Badge
    Chapter 13 Constructive Kripke Semantics and Realizability
  15. Altmetric Badge
    Chapter 14 Splitting and Density for the Recursive Sets of a Fixed Time Complexity
  16. Altmetric Badge
    Chapter 15 Reals and Forcing with an Elementary Topos
  17. Altmetric Badge
    Chapter 16 Completeness Theorems for Logics of Feature Structures
  18. Altmetric Badge
    Chapter 17 Concurrent Programs as Strategies in Games
  19. Altmetric Badge
    Chapter 18 Finite and Infinite Dialogues
  20. Altmetric Badge
    Chapter 19 Some Relations Between Subsystems of Arithmetic and Complexity of Computations
  21. Altmetric Badge
    Chapter 20 Logics for Negation as Failure
  22. Altmetric Badge
    Chapter 21 Normal Varieties of Combinators
  23. Altmetric Badge
    Chapter 22 Complexity of Proofs in Classical Propositional Logic
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
syllabi
1 institution with syllabi

Citations

dimensions_citation
2 Dimensions
Summary X Syllabi Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Logic from Computer Science : Proceedings of a Workshop held November 13–17, 1989
Published by
Springer, New York, NY, January 1992
DOI 10.1007/978-1-4612-2822-6
ISBNs
978-1-4612-2822-6, 978-1-4612-7685-2
Editors

Moschovakis, Yiannis N.

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.

This page is provided by Altmetric.