Logic from Computer Science/ (Record no. 177093)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 00353nam a2200133Ia 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 0387976671 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | CUS |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 511.3 |
| Item number | MOS/L |
| 245 #0 - TITLE STATEMENT | |
| Title | Logic from Computer Science/ |
| Statement of responsibility, etc. | edited by Y.N. Moschovakis. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | New York: |
| Name of publisher, distributor, etc. | Springer-Verlag, |
| Date of publication, distribution, etc. | 1991. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xi,608p. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | <br/>H. Barringer and D. Gabbay<br/>The Imperative Future: Past Successes =j> Fi pure<br/>Actions 1<br/>E. Berger<br/>A Logical Operational Semantics of Full Prolog:<br/>Part III. Built-in Predicates for Files, Terms,<br/>Arithmetic and Input-Output 17<br/>S. A. Cook<br/>COMPUTABILITY AND COMPLEXITY OF HiGHER TyPE<br/>Functions 51<br/>R. Di Cosmo and C. Longo<br/>Constructively Equivalent Propositions and<br/>Isomorphisms of Objects, or Terms as Natural<br/>Transformations 73<br/>S. Feferman<br/>Logics for Termination and Correctness<br/>of Functional Programs 95<br/>K. Fine<br/>Transparent Grammars 129<br/><br/>No CotiNtfr-Example Information and<br/>Interactive Computation 287<br/>D. Leivant<br/>Semantic Characterizations of Number Tiip:ories . . 295<br/>J. Lipton<br/>Constructive Kripke Semantics and Realizability . . 319<br/>W. Maass and TASlaman<br/>Splitting and Density f'or the Recursive Sets<br/>OF A Fixed Time Complexity 359<br/>S. Max) Lane and I. Moerdijk<br/>Reals and Forcing with an Elementary Topos 373<br/>L. S. Moss<br/>CONTENTS xi<br/>COMPLETENESS THEOREMS FOR LOGICS OF FeATURE<br/>Structures 387<br/>A. Nerodo. A. Yakhnis and V. Yaklinis<br/>Concurrent Programs as Strategies in Games 405<br/>R. Parikh<br/>Finite and Infinite Dialogues 481<br/>P. Pudlak<br/>Some Relations Between Subsystems of Arithmetic<br/>and Complexity of Computations 499<br/>J. C. Shepherdson<br/>Logics for Negation as Failure 521<br/>R. Statinan<br/>Normal Varieties of Combinators 585<br/>A. Urquhart<br/>Complexity of Proofs in Classical Propositional<br/> |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | General Books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Full call number | Accession number | Date last seen | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Central Library, Sikkim University | Central Library, Sikkim University | General Book Section | 29/08/2016 | 511.3 MOS/L | P32095 | 29/08/2016 | General Books |