Normal view MARC view ISBD view

Logic from Computer Science/ edited by Y.N. Moschovakis.

Material type: Text

TextPublication details: New York: Springer-Verlag, 1991Description: xi,608pISBN: 0387976671DDC classification: 511.3

Contents:

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

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 1 )
Comments ( 0 )

Holdings
Item type	Current library	Call number	Status	Date due	Barcode	Item holds
General Books	Central Library, Sikkim University General Book Section	511.3 MOS/L (Browse shelf(Opens below))	Available		P32095

Total holds: 0

Browsing Central Library, Sikkim University shelves, Shelving location: General Book Section Close shelf browser (Hides shelf browser)

Previous								Next
Previous	511.3 LEW/E Elements of the Theory of Computation,	511.3 MAN/C A course in mathematical logic for mathematicians/	511.3 MON/M Mathematical logic/	511.3 MOS/L Logic from Computer Science/	511.3 SRI/C A Course on Mathematical Logic/	511.3 TOU/M Mathematical logic/	511.313 BUC/I An Introduction to Fuzzy Logic and Fuzzy Sets/	Next

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

There are no comments on this title.

to post a comment.