Matches in Library of Congress for { <http://lccn.loc.gov/2011282450> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- 2011282450 contributor B12170950.
- 2011282450 created "c2011.".
- 2011282450 date "2011".
- 2011282450 date "c2011.".
- 2011282450 dateCopyrighted "c2011.".
- 2011282450 description "Includes bibliographical references (p. 151) and index.".
- 2011282450 description "Part. 1. Proofs: -- 1. Predicate logic. --Inductive definitions -- Languages -- The languages of predicate logic -- Proofs -- Examples of theories -- Variations on the principle of the excluded middle -- 2. Models. -- The notion of a model -- The Soundness Theorem -- The Completeness Theorem -- Other applications of the notion of model -- Part 2. Algorithms: -- 3. Computable functions. -- Computability over lists and trees -- Eliminating recursion -- Programs -- 4. Computation as a sequence of small steps. -- Rewriting -- The Lambda-Calculus -- Turing Machines -- Part 3. Proofs and algorithms: -- 5. Church's Theorem. -- The notion of reduction -- Representing programs -- Church's Theorem -- Semi-decidabilty -- Gödel's First Incompleteness Theorem -- 6. Automated theorem proving. -- Sequent Calculus -- Proof search in the sequent Calculus without cuts -- 7. Decidable theories -- 8. Constructivity -- 9. Epilogue.".
- 2011282450 extent "xii, 155 p. :".
- 2011282450 identifier "0857291203".
- 2011282450 identifier "9780857291202".
- 2011282450 identifier 2011282450-b.html.
- 2011282450 identifier 2011282450-d.html.
- 2011282450 identifier 2011282450-t.html.
- 2011282450 isPartOf "Undergraduate topics in computer science, 1863-7310".
- 2011282450 isPartOf "Undergraduate topics in computer science.".
- 2011282450 issued "2011".
- 2011282450 issued "c2011.".
- 2011282450 language "eng".
- 2011282450 publisher "London ; New York : Springer,".
- 2011282450 subject "004.015113 22".
- 2011282450 subject "Algorithms.".
- 2011282450 subject "Logic, Symbolic and mathematical.".
- 2011282450 subject "QA9 .D68 2011".
- 2011282450 tableOfContents "Part. 1. Proofs: -- 1. Predicate logic. --Inductive definitions -- Languages -- The languages of predicate logic -- Proofs -- Examples of theories -- Variations on the principle of the excluded middle -- 2. Models. -- The notion of a model -- The Soundness Theorem -- The Completeness Theorem -- Other applications of the notion of model -- Part 2. Algorithms: -- 3. Computable functions. -- Computability over lists and trees -- Eliminating recursion -- Programs -- 4. Computation as a sequence of small steps. -- Rewriting -- The Lambda-Calculus -- Turing Machines -- Part 3. Proofs and algorithms: -- 5. Church's Theorem. -- The notion of reduction -- Representing programs -- Church's Theorem -- Semi-decidabilty -- Gödel's First Incompleteness Theorem -- 6. Automated theorem proving. -- Sequent Calculus -- Proof search in the sequent Calculus without cuts -- 7. Decidable theories -- 8. Constructivity -- 9. Epilogue.".
- 2011282450 title "Proofs and algorithms : an introduction to logic and computability / Gilles Dowek.".
- 2011282450 type "text".