000 05654nam a2200781 i 4500
001 6812988
003 IEEE
005 20200413152911.0
006 m eo d
007 cr cn |||m|||a
008 130917s2013 caua foab 000 0 eng d
020 _a9781627052481
_qelectronic bk.
020 _z9781627052474
_qpbk.
024 7 _a10.2200/S00518ED2V01Y201306CSL006
_2doi
035 _a(CaBNVSL)swl00402735
035 _a(OCoLC)858583601
040 _aCaBNVSL
_beng
_erda
_cCaBNVSL
_dCaBNVSL
050 4 _aBC15
_b.G455 2013
082 0 4 _a160.9
_223
090 _a
_bMoCl
_e201306CSL006
100 1 _aGenesereth, Michael R.,
_d1948-,
_eauthor.
245 1 0 _aIntroduction to logic /
_cMichael Genesereth and Eric Kao.
250 _aSecond edition.
264 1 _aSan Rafael, California (1537 Fourth Street, San Rafael, CA 94901 USA) :
_bMorgan & Claypool,
_c2013.
300 _a1 PDF (xi, 151 pages) :
_billustrations.
336 _atext
_2rdacontent
337 _aelectronic
_2isbdmedia
338 _aonline resource
_2rdacarrier
490 1 _aSynthesis lectures on computer science,
_x1932-1686 ;
_v# 6
538 _aMode of access: World Wide Web.
538 _aSystem requirements: Adobe Acrobat Reader.
500 _aPart of: Synthesis digital library of engineering and computer science.
500 _aSeries from website.
504 _aIncludes bibliographical references (page 149).
505 0 _aPreface -- 1. Introduction -- 1.1 Logic -- 1.2 Elements of logic -- 1.3 Formalization -- 1.4 Automation -- 1.5 Reading guide --
505 8 _a2. Propositional logic -- 2.1 Introduction -- 2.2 Syntax -- 2.3 Semantics -- 2.4 Satisfaction -- 2.5 Logical properties of propositional sentences -- 2.6 Propositional entailment --
505 8 _a3. Satisfiability -- 3.1 Introduction -- 3.2 Truth table method -- 3.3 Basic backtracking search -- 3.4 Simplification and unit propagation -- 3.5 DPLL -- 3.6 GSAT --
505 8 _a4. Propositional proofs -- 4.1 Introduction -- 4.2 Linear proofs -- 4.3 Structured proofs -- 4.4 Fitch -- 4.5 Soundness and completeness --
505 8 _a5. Propositional resolution -- 5.1 Introduction -- 5.2 Clausal form -- 5.3 Resolution principle -- 5.4 Resolution reasoning --
505 8 _a6. Relational logic -- 6.1 Introduction -- 6.2 Syntax -- 6.3 Semantics -- 6.4 Example: sorority world -- 6.5 Example: blocks world -- 6.6 Example: modular arithmetic -- 6.7 Example: Peano arithmetic -- 6.8 Example: linked lists -- 6.9 Example: pseudo English -- 6.10 Example: metalevel logic -- 6.11 Properties of sentences in relational logic -- 6.12 Logical entailment -- 6.13 Finite relational logic -- 6.14 Omega relational logic -- 6.15 General relational logic --
505 8 _a7. Relational logic proofs -- 7.1 Introduction -- 7.2 Proofs -- 7.3 Example -- 7.4 Example -- 7.5 Example --
505 8 _a8. Resolution -- 8.1 Introduction -- 8.2 Clausal form -- 8.3 Unification -- 8.4 Resolution principle -- 8.5 Resolution reasoning -- 8.6 Unsatisfiability -- 8.7 Logical entailment -- 8.8 Answer extraction -- 8.9 Strategies --
505 8 _a9. Induction -- 9.1 Introduction -- 9.2 Domain closure -- 9.3 Linear Induction -- 9.4 Tree induction -- 9.5 Structural induction -- 9.6 Multidimensional induction -- 9.7 Embedded induction -- 9.8 Recap --
505 8 _a10. Equality -- 10.1 Introduction -- 10.2 Properties of equality -- 10.3 Substitution -- 10.4 Fitch with equality -- 10.5 Example, group theory -- 10.6 Recap --
505 8 _aA. Summary of Fitch rules -- Bibliography -- Authors' biographies.
506 1 _aAbstract freely available; full-text restricted to subscribers or individual document purchasers.
510 0 _aCompendex
510 0 _aINSPEC
510 0 _aGoogle scholar
510 0 _aGoogle book search
520 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.
530 _aAlso available in print.
588 _aTitle from PDF title page (viewed on September 17, 2013).
650 0 _aLogic.
653 _aformal logic
653 _asymbolic logic
653 _apropositional logic
653 _arelational logic
653 _adeduction
653 _areasoning
653 _aartificial intelligence
700 1 _aKao, Eric.,
_eauthor.
776 0 8 _iPrint version:
_z9781627052474
830 0 _aSynthesis digital library of engineering and computer science.
830 0 _aSynthesis lectures on computer science ;
_v# 6.
_x1932-1686
856 4 2 _3Abstract with links to resource
_uhttp://ieeexplore.ieee.org/servlet/opac?bknumber=6812988
856 4 0 _3Abstract with links to full text
_uhttp://dx.doi.org/10.2200/S00518ED2V01Y201306CSL006
999 _c562017
_d562017