National Science Library of Georgia

Computability and logic / (Record no. 520353)

MARC details
000 -LEADER
fixed length control field 03037nam a22004098i 4500
001 - CONTROL NUMBER
control field CR9781139164931
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 111007s2002||||enk o ||1 0|eng|d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781139164931 (ebook)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Cancelled/invalid ISBN 9780521809757 (hardback)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Cancelled/invalid ISBN 9780521007580 (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 2002
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511.3
Edition number 21
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 Fourth 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 2002.
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource (xi, 356 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 00 - FORMATTED CONTENTS NOTE
Miscellaneous information 1.
Title Enumerability --
Miscellaneous information 2.
Title Diagonalization --
Miscellaneous information 3.
Title Turing Computability --
Miscellaneous information 4.
Title Uncomputability --
Miscellaneous information 5.
Title Abacus Computability --
Miscellaneous information 6.
Title Recursive Functions --
Miscellaneous information 7.
Title Recursive Sets and Relations --
Miscellaneous information 8.
Title Equivalent Definitions of Computability --
Miscellaneous information 9.
Title A Precis of First-Order Logic: Syntax --
Miscellaneous information 10.
Title A Precis of First-Order Logic: Semantics --
Miscellaneous information 11.
Title The Undecidability of First-Order Logic --
Miscellaneous information 12.
Title Models --
Miscellaneous information 13.
Title The Existence of Models --
Miscellaneous information 14.
Title Proofs and Completeness --
Miscellaneous information 15.
Title Arithmetization --
Miscellaneous information 16.
Title Representability of Recursive Functions --
Miscellaneous information 17.
Title Indefinability, Undecidability, Incompleteness --
Miscellaneous information 18.
Title The Unprovability of Consistency --
Miscellaneous information 19.
Title Normal Forms --
Miscellaneous information 20.
Title The Craig Interpolation Theorem --
Miscellaneous information 21.
Title Monadic and Dyadic Logic --
Miscellaneous information 22.
Title Second-Order Logic.
520 ## - SUMMARY, ETC.
Summary, etc This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book 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. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer.
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 9780521809757
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1017/CBO9781139164931">https://doi.org/10.1017/CBO9781139164931</a>

No items available.

Copyright © 2023 Sciencelib.ge All rights reserved.