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
LEADER 02476nmm a2200325 u 4500
001 EB000619241
003 EBX01000000000000000472323
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9781461228226 
100 1 |a Moschovakis, Yiannis N. 
245 0 0 |a Logic from Computer Science  |h Elektronische Ressource  |b Proceedings of a Workshop held November 13–17, 1989  |c edited by Yiannis N. Moschovakis 
260 |a New York, NY  |b Springer New York  |c 1992, 1992 
300 |a XI, 608p. 10 illus  |b online resource 
505 0 |a 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 
653 |a Mathematics 
653 |a Computer science 
653 |a Logic, Symbolic and mathematical 
653 |a Mathematics 
653 |a Mathematical Logic and Foundations 
653 |a Mathematical Logic and Formal Languages 
710 2 |a SpringerLink (Online service) 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Mathematical Sciences Research Institute Publications 
856 |u http://dx.doi.org/10.1007/978-1-4612-2822-6?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 511.3 
520 |a 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 Moerdijk, and Concurrent Computation as Game Playing by Anil Nerode