000			03022nam a22004935i 4500
001			978-88-470-2361-1
003			DE-He213
005			20140220083335.0
007			cr nn 008mamaa
008			120329s2012 it | s |||| 0|eng d
020			_a9788847023611 _9978-88-470-2361-1
024	7		_a10.1007/978-88-470-2361-1 _2doi
050		4	_aQA8.9-10.3
072		7	_aPBC _2bicssc
072		7	_aPBCD _2bicssc
072		7	_aMAT018000 _2bisacsh
082	0	4	_a511.3 _223
100	1		_aMundici, Daniele. _eauthor.
245	1	0	_aLogic: A Brief Course _h[electronic resource] / _cby Daniele Mundici.
264		1	_aMilano : _bSpringer Milan : _bImprint: Springer, _c2012.
300			_aXI, 130 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aUNITEXT, _x2038-5714
505	0		_aIntroduction -- Fundamental Logical Notions -- The Resolution Method -- Robinson Completeness Theorem -- Fast Classes for DPP -- Godel Compactness Theorem -- Propositional Logic: Syntax -- Propositional Logic: Semantics -- Normal Forms -- Recap: Expressivity and Efficiency -- The Quantifiers ‘There Exists’ and ‘For All’ -- Syntax of Predicate Logic -- The Meaning of Clauses -- Godel Completeness Theorem for the Logic of Clauses -- Equality Axioms -- The Predicate Logic L.
520			_aThis short book, geared towards undergraduate students of computer science and mathematics, is specifically designed for a first course in mathematical logic. A proof of Gödel's completeness theorem and its main consequences is given using Robinson's completeness theorem and Gödel's compactness theorem for propositional logic. The reader will familiarize himself with many basic ideas and artifacts of mathematical logic: a non-ambiguous syntax, logical equivalence and consequence relation, the Davis-Putnam procedure, Tarski semantics, Herbrand models, the axioms of identity, Skolem normal forms, nonstandard models and, interestingly enough, proofs and refutations viewed as graphic objects. The mathematical prerequisites are minimal: the book is accessible to anybody having some familiarity with proofs by induction. Many exercises on the relationship between natural language and formal proofs make the book also interesting to a wide range of students of philosophy and linguistics.
650		0	_aMathematics.
650		0	_aComputer science.
650		0	_aLogic, Symbolic and mathematical.
650		0	_aSemantics.
650	1	4	_aMathematics.
650	2	4	_aMathematical Logic and Foundations.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aSemantics.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9788847023604
830		0	_aUNITEXT, _x2038-5714
856	4	0	_uhttp://dx.doi.org/10.1007/978-88-470-2361-1
912			_aZDB-2-SMA
999			_c104118 _d104118