The Resource Proofs and algorithms : an introduction to logic and computability, Gilles Dowek
Proofs and algorithms : an introduction to logic and computability, Gilles Dowek
Resource Information
The item Proofs and algorithms : an introduction to logic and computability, Gilles Dowek represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Proofs and algorithms : an introduction to logic and computability, Gilles Dowek represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
- Summary
- Proofs and Algorithms: An Introduction to Logic and Computability Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation. Proofs and Algorithms: An Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel's incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself. Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic
- Language
- eng
- Extent
- 1 online resource (xii, 155 pages).
- Contents
-
- Part 1. Proofs
- Predicate Logic
- Models
- Part 2. Algorithms
- Computable functions
- Computation as a sequence of small steps
- Part 3. Proofs and algorithms
- Church's theorem
- Automated theorem proving
- Decidable theories
- Constructivity
- Isbn
- 9780857291219
- Label
- Proofs and algorithms : an introduction to logic and computability
- Title
- Proofs and algorithms
- Title remainder
- an introduction to logic and computability
- Statement of responsibility
- Gilles Dowek
- Language
- eng
- Summary
- Proofs and Algorithms: An Introduction to Logic and Computability Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation. Proofs and Algorithms: An Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel's incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself. Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic
- Cataloging source
- GW5XE
- http://library.link/vocab/creatorName
- Dowek, Gilles
- Dewey number
- 005.13/1
- Index
- index present
- Language note
- English
- LC call number
- QA9
- LC item number
- .D69 2011
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- bibliography
- Series statement
- Undergraduate topics in computer science
- http://library.link/vocab/subjectName
-
- Logic, Symbolic and mathematical
- Algorithms
- Informatique
- Algorithms
- Logic, Symbolic and mathematical
- Label
- Proofs and algorithms : an introduction to logic and computability, Gilles Dowek
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Color
- multicolored
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Part 1. Proofs -- Predicate Logic -- Models -- Part 2. Algorithms -- Computable functions -- Computation as a sequence of small steps -- Part 3. Proofs and algorithms -- Church's theorem -- Automated theorem proving -- Decidable theories -- Constructivity
- Control code
- 704393907
- Dimensions
- unknown
- Extent
- 1 online resource (xii, 155 pages).
- Form of item
- online
- Isbn
- 9780857291219
- Lccn
- 2011282450
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/978-0-85729-121-9
- http://library.link/vocab/ext/overdrive/overdriveId
- 978-0-85729-120-2
- Specific material designation
- remote
- System control number
- (OCoLC)704393907
- Label
- Proofs and algorithms : an introduction to logic and computability, Gilles Dowek
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Color
- multicolored
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Part 1. Proofs -- Predicate Logic -- Models -- Part 2. Algorithms -- Computable functions -- Computation as a sequence of small steps -- Part 3. Proofs and algorithms -- Church's theorem -- Automated theorem proving -- Decidable theories -- Constructivity
- Control code
- 704393907
- Dimensions
- unknown
- Extent
- 1 online resource (xii, 155 pages).
- Form of item
- online
- Isbn
- 9780857291219
- Lccn
- 2011282450
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/978-0-85729-121-9
- http://library.link/vocab/ext/overdrive/overdriveId
- 978-0-85729-120-2
- Specific material designation
- remote
- System control number
- (OCoLC)704393907
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Proofs-and-algorithms--an-introduction-to-logic/-DO_BDyld10/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Proofs-and-algorithms--an-introduction-to-logic/-DO_BDyld10/">Proofs and algorithms : an introduction to logic and computability, Gilles Dowek</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Proofs and algorithms : an introduction to logic and computability, Gilles Dowek
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Proofs-and-algorithms--an-introduction-to-logic/-DO_BDyld10/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Proofs-and-algorithms--an-introduction-to-logic/-DO_BDyld10/">Proofs and algorithms : an introduction to logic and computability, Gilles Dowek</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>