LEADER 05745nam 2200793 450 001 9910151959303321 005 20161205164704.0 010 $a1-62705-999-7 024 7 $a10.2200/S00734ED2V01Y201609CSL008 035 $a(CKB)3710000000953582 035 $a(MiAaPQ)EBC4744543 035 $a(CaBNVSL)swl00406950 035 $a(OCoLC)965304393 035 $a(IEEE)7748632 035 $a(MOCL)201609CSL008 035 $a(EXLCZ)993710000000953582 100 $a20161205d2017 fy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aIntroduction to logic /$fMichael Genesereth, Eric Kao 205 $aThird edition. 210 1$aSan Rafael, California (1537 Fourth Street, San Rafael, CA 94901 USA) :$cMorgan & Claypool,$d2017. 215 $a1 online resource (179 pages) $cillustrations (some color) 225 1 $aSynthesis lectures on computer science,$x1932-1686 ;$v# 8 300 $aPart of: Synthesis digital library of engineering and computer science. 300 $aSeries from website. 311 $a1-62705-636-X 320 $aIncludes bibliographical references (page 161). 327 $a1. Introduction -- 1.1 Introduction -- 1.2 Possible worlds -- 1.3 Logical sentences -- 1.4 Logical entailment -- 1.5 Logical proofs -- 1.6 Formalization -- 1.7 Automation -- 1.8 Reading guide -- 1.9 Exercises -- 327 $a2. Propositional logic -- 2.1 Introduction -- 2.2 Syntax -- 2.3 Semantics -- 2.4 Evaluation -- 2.5 Satisfaction -- 2.6 Example-natural languagE -- 2.7 Example-digital circuits -- 2.8 Exercises -- 327 $a3. Logical properties and relationships -- 3.1 Introduction -- 3.2 Logical properties -- 3.3 Logical equivalence -- 3.4 Logical entailment -- 3.5 Logical consistency -- 3.6 Connections between properties and relationships -- 3.7 Exercises -- 327 $a4. Propositional proofs -- 4.1 Introduction -- 4.2 Linear reasoning -- 4.3 Hypothetical reasoning -- 4.4 Fitch -- 4.5 Reasoning tips -- 4.6 Soundness and completeness -- 4.7 Exercises -- 327 $a5. Propositional resolution -- 5.1 Introduction -- 5.2 Clausal form -- 5.3 Resolution principle -- 5.4 Resolution reasoning -- 5.5 Exercises -- 327 $a6. Relational logic -- 6.1 Introduction -- 6.2 Syntax -- 6.3 Semantics -- 6.4 Evaluation -- 6.5 Satisfaction -- 6.6 Example- sorority world -- 6.7 Example- blocks world -- 6.8 Example- modular arithmetic -- 6.9 Logical properties -- 6.10 Logical entailment -- 6.11 Relational logic and propositional logic -- 6.12 Exercises -- 327 $a7. Relational analysis -- 7.1 Introduction -- 7.2 Truth tables -- 7.3 Semantic trees -- 7.4 Boolean models -- 7.5 Non-boolean models -- 7.6 Exercises -- 327 $a8. Relational proofs -- 8.1 Introduction -- 8.2 Proofs -- 8.3 Example -- 8.4 Example -- 8.5 Example -- 8.6 Exercises -- 327 $a9. Herbrand logic -- 9.1 Introduction -- 9.2 Syntax and semantics -- 9.3 Evaluation and satisfaction -- 9.4 Example- Peano arithmetic -- 9.5 Example- linked lists -- 9.6 Example- pseudo English -- 9.7 Example- metalevel logic -- 9.8 Undecidability -- 9.9 Exercises -- 327 $a10. Herbrand proofs -- 10.1 Introduction -- 10.2 Non-compactness and incompleteness -- 327 $a11. Induction -- 11.1 Introduction -- 11.2 Domain closure -- 11.3 Linear induction -- 11.4 Tree induction -- 11.5 Structural induction -- 11.6 Multidimensional induction -- 11.7 Embedded induction -- 11.8 Exercises -- 327 $a12. Resolution -- 12.1 Introduction -- 12.2 Clausal form -- 12.3 Unification -- 12.4 Resolution principle -- 12.5 Resolution reasoning -- 12.6 Unsatisfiability -- 12.7 Logical entailment -- 12.8 Answer extraction -- 12.9 Strategies -- 12.10 Exercises -- 327 $aBibliography -- Authors' biographies. 330 3 $aThis book is a gentle but rigorous introduction to Formal Logic. It is intended primarily for use at the college level. However, it can also be used for advanced secondary school students, and it can be used at the start of graduate school for those who have not yet seen the material. The approach to teaching logic used here emerged from more than 20 years of teaching logic to students at Stanford University and from teaching logic to tens of thousands of others via online courses on the World Wide Web. The approach differs from that taken by other books in logic in two essential ways, one having to do with content, the other with form. Like many other books on logic, this one covers logical syntax and semantics and proof theory plus induction. However, unlike other books, this book begins with Herbrand semantics rather than the more traditional Tarskian semantics. This approach makes the material considerably easier for students to understand and leaves them with a deeper understanding of what logic is all about. 410 0$aSynthesis digital library of engineering and computer science. 410 0$aSynthesis lectures on computer science ;$v# 8.$x1932-1686 606 $aLogic 606 $aHerbrand's theorem (Number theory) 610 $aformal logic 610 $asymbolic logic 610 $apropositional logic 610 $aHerbrand logic 610 $arelational logic 610 $adeduction 610 $areasoning 610 $aartificial intelligence 615 0$aLogic. 615 0$aHerbrand's theorem (Number theory) 676 $a160.9 700 $aGenesereth$b Michael R.$f1948-,$052644 702 $aKao$b Eric. 801 0$bCaBNVSL 801 1$bCaBNVSL 801 2$bCaBNVSL 906 $aBOOK 912 $a9910151959303321 996 $aIntroduction to logic$92962292 997 $aUNINA