Computability and logic / (Record no. 520352)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02927nam a22004098i 4500 |
| 001 - CONTROL NUMBER | |
| control field | CR9780511804076 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | UkCbUP |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200124160301.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS--GENERAL INFORMATION | |
| fixed length control field | m|||||o||d|||||||| |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr|||||||||||| |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 101021s2007||||enk o ||1 0|eng|d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780511804076 (ebook) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Cancelled/invalid ISBN | 9780521877527 (hardback) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Cancelled/invalid ISBN | 9780521701464 (paperback) |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | UkCbUP |
| Language of cataloging | eng |
| Description conventions | rda |
| Transcribing agency | UkCbUP |
| 050 00 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA9.59 |
| Item number | .B66 2007 |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 511.3/52 |
| Edition number | 22 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Boolos, George, |
| Relator term | author. |
| 245 10 - TITLE STATEMENT | |
| Title | Computability and logic / |
| Statement of responsibility, etc | George S. Boolos, John P. Burgess , Richard C. Jeffrey. |
| 246 3# - VARYING FORM OF TITLE | |
| Title proper/short title | Computability & Logic |
| 250 ## - EDITION STATEMENT | |
| Edition statement | Fifth edition. |
| 264 #1 - Production, Publication, Distribution, Manufacture, and Copyright Notice (R) | |
| Place of production, publication, distribution, manufacture (R) | Cambridge : |
| Name of producer, publisher, distributor, manufacturer (R) | Cambridge University Press, |
| Date of production, publication, distribution, manufacture, or copyright notice | 2007. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 1 online resource (xiii, 350 pages) : |
| Other physical details | digital, PDF file(s). |
| 336 ## - Content Type (R) | |
| Content type term (R) | text |
| Content type code (R) | txt |
| Source (NR) | rdacontent |
| 337 ## - Media Type (R) | |
| Media type term (R) | computer |
| Media type code (R) | c |
| Source (NR) | rdamedia |
| 338 ## - Carrier Type (R) | |
| Carrier type term (R) | online resource |
| Carrier type code (R) | cr |
| Source (NR) | rdacarrier |
| 500 ## - GENERAL NOTE | |
| General note | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Enumerability -- Diagonalization -- Turing Computability -- Uncomputability -- Abacus Computability -- Recursive Functions -- Recursive Sets and Relations -- Equivalent Definitions of Computability -- Precis of First-Order Logic: Syntax -- Precis of First-Order Logic: Semantics -- Undecidability of First-Order Logic -- Models -- Existence of Models -- Proofs and Completeness -- Arithmetization -- Representability of Recursive Functions -- Indefinability, Undecidability, Incompleteness -- Unprovability of Consistency -- Normal Forms -- Craig Interpolation Theorem -- Monadic and Dyadic Logic -- Second-Order Logic -- Arithmetical Definability -- Decidability of Arithmetic without Multiplication -- Nonstandard Models -- Ramsey's Theorem -- Modal Logic and Provability. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computable functions. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Recursive functions. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Logic, Symbolic and mathematical. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Burgess, John P., |
| Dates associated with a name | 1948- |
| Relator term | author. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Jeffrey, Richard C., |
| Relator term | author. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Print version: |
| International Standard Book Number | 9780521877527 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1017/CBO9780511804076">https://doi.org/10.1017/CBO9780511804076</a> |
No items available.