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

Topics of this proceedings volume will include Computability and Complexity of Higher Type Functions by Stephen Cook, Logics for Termination and Correctness of Functional Programs by Solomon Feferman, Reals and Forcing with Elementary Topos by the well known mathematician, Saunders MacLane and Ieke...

Full description

Main Author: Moschovakis, Yiannis N.
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: New York, NY Springer New York 1992, 1992
Series:Mathematical Sciences Research Institute Publications
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • 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 Ele