Logic from Computer Science Proceedings of a Workshop held November 13–17, 1989
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...
| Other Authors: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY
Springer New York
1992, 1992
|
| Edition: | 1st ed. 1992 |
| Series: | Mathematical Sciences Research Institute Publications
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Preface
- The Imperative Future: Past Successes Future Actions
- A Logical Operational Semantics of Full Prolog: Part III. Built-in Predicates for Files, Terms, Arithmetic and Input-Output
- Computability and Complexity of Higher Type Functions
- Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transfomrations
- Logics for Termination and Correctness of Functional Programs
- Transparent Grammars
- Designing Unification Procedures Using Transformations: A survey
- NormaL Forms and Cut-Free Proofs as Natural Transformations
- Computer Implementation and Applications of Kleene’s S-M-N and Recursion Theorems
- 0–1 Laws for Fragments of Second-Order Logic: an Overview
- No Counter-Example Interpretation and Interactive Computation
- Semantic Characterizations of Number Theories
- Constructive Kripke Semantics and Realizability
- Splitting and Density for the Recursive Sets of a Fixed Time Complexity
- Reals and Forcing with an Elementary Topos
- Completeness Theorems for Logics of Feature Structures
- Concurrent Programs as Strategies in Games
- Finite and Infinite Dialogues
- Some Relations Between Subsystems of Arithmetic and Complexity of Computations
- Logics for Negation as Failure
- Normal Varieties of Combinators
- Complexity of Proofs in Classical Propositional Logic