| 000 -LEADER |
|---|
| fixed length control field |
02364nam a2200241 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
vtls001999460 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
MY-SjTCS |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20200226121421.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
110218 00 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0198534507 |
| 039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE] |
|---|
| Level of rules in bibliographic description |
201102181305 |
| Level of effort used to assign nonsubject heading access points |
VLOAD |
| -- |
200407271920 |
| -- |
VLOAD |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
511.3 |
| Item number |
SMU |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Smullyan, Raymond M. |
| 9 (RLIN) |
12136 |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Diagonalization and self-reference / |
| Statement of responsibility, etc. |
Raymond M. Smullyan |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Oxford, U.K. : |
| Name of publisher, distributor, etc. |
Clarendon Press, |
| Date of publication, distribution, etc. |
1994 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xv, 396 p. ; |
| Dimensions |
24 cm. |
| 440 #0 - SERIES STATEMENT/ADDED ENTRY--TITLE |
|---|
| Title |
Oxford logic guides ; |
| Volume/sequential designation |
27 |
| 9 (RLIN) |
105503 |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
1. Introduction to Self-Reference and Recursion. - 1. Introduction to self-reference. 2. Some classical fixed point arguments compared. 3. How to silence a universal machine. 4. Some general incompleteness theorems. 5. Self-reference in arithmetic. 6. Introduction to formal systems and recursion. 7. A universal system and its applications. - II. Systems with Effective Properties. 8. Arithmetization of formal systems. 9. Elementary formal systems and incompleteness proofs. 10. Doubly indexed relational systems. 11. Effective representation systems. - III. Fixed Point Theorems in a General Setting. 12. Sequential systems. 13. Strong fixed point properties. 14. Multiple fixed point properties. 15. Synchronization and pairing functions. 16. Some further relations between fixed point properties. - IV. Combinators and Sequential Systems. 17. Fixed point properties of combinatory logic. 18. Formal combinatory logic. 19. A second variety of fixed point theorems. 20. Extended sequential systems. - References. - Index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
This volume is written for the beginner and expert alike, since it is both an introduction to self-reference, diagonalization, and fixed points, as they occur in Godel's incompleteness proofs, recursion theory, combinatory logic, semantics, and metamathematics, and a presentation of new results - partly in these areas, but mostly in their synthesis, as developed in the last nine chapters. No prior knowledge of these fields is presupposed, except that for the applications to mathematical logic in Chapter 5 and 9, a little acquaintance with the logical connectives and quantifiers, though not strictly necessary, is desirable. - Preface. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Fixed point theory. |
| 9 (RLIN) |
105504 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Recursion theory. |
| 920 ## - Programme |
|---|
| Programme |
GEN : 102238 |
| 999 ## - SYSTEM CONTROL NUMBERS (KOHA) |
|---|
| Koha biblionumber |
182568 |
| Koha biblioitemnumber |
182568 |
