TY  - BOOK
TI  - Logic from Computer Science
SN  - 0387976671
U1  - 511.3 
PY  - 1991///
CY  - New York
PB  - Springer-Verlag
N1  - 
H. Barringer and D. Gabbay
The Imperative Future: Past Successes =j> Fi pure
Actions 1
E. Berger
A Logical Operational Semantics of Full Prolog:
Part III. Built-in Predicates for Files, Terms,
Arithmetic and Input-Output 17
S. A. Cook
COMPUTABILITY AND COMPLEXITY OF HiGHER TyPE
Functions 51
R. Di Cosmo and C. Longo
Constructively Equivalent Propositions and
Isomorphisms of Objects, or Terms as Natural
Transformations 73
S. Feferman
Logics for Termination and Correctness
of Functional Programs 95
K. Fine
Transparent Grammars 129

No CotiNtfr-Example Information and
Interactive Computation 287
D. Leivant
Semantic Characterizations of Number Tiip:ories . . 295
J. Lipton
Constructive Kripke Semantics and Realizability . . 319
W. Maass and TASlaman
Splitting and Density f'or the Recursive Sets
OF A Fixed Time Complexity 359
S. Max) Lane and I. Moerdijk
Reals and Forcing with an Elementary Topos 373
L. S. Moss
CONTENTS xi
COMPLETENESS THEOREMS FOR LOGICS OF FeATURE
Structures 387
A. Nerodo. A. Yakhnis and V. Yaklinis
Concurrent Programs as Strategies in Games 405
R. Parikh
Finite and Infinite Dialogues 481
P. Pudlak
Some Relations Between Subsystems of Arithmetic
and Complexity of Computations 499
J. C. Shepherdson
Logics for Negation as Failure 521
R. Statinan
Normal Varieties of Combinators 585
A. Urquhart
Complexity of Proofs in Classical Propositional

ER  -