Logic: a Brief Course

This 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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Mundici, Daniele (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Milano : Springer Milan : Imprint: Springer, 2012.
Edición:1st ed. 2012.
Colección:La Matematica per il 3+2,
Temas:
Mathematical logic.
Machine theory.
Semiotics.
Mathematical Logic and Foundations.
Formal Languages and Automata Theory.
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-88-470-2361-1
003 DE-He213
005 20220115211209.0
007 cr nn 008mamaa
008 120329s2012 it | s |||| 0|eng d
020 |a 9788847023611  |9 978-88-470-2361-1 
024 7 |a 10.1007/978-88-470-2361-1  |2 doi 
050 4 |a QA8.9-10.3 
072 7 |a PBCD  |2 bicssc 
072 7 |a PBC  |2 bicssc 
072 7 |a MAT018000  |2 bisacsh 
072 7 |a PBCD  |2 thema 
072 7 |a PBC  |2 thema 
082 0 4 |a 511.3  |2 23 
100 1 |a Mundici, Daniele.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Logic: a Brief Course  |h [electronic resource] /  |c by Daniele Mundici. 
250 |a 1st ed. 2012. 
264 1 |a Milano :  |b Springer Milan :  |b Imprint: Springer,  |c 2012. 
300 |a XI, 130 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a La Matematica per il 3+2,  |x 2038-5757 
505 0 |a Introduction -- 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 |a This 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 |a Mathematical logic. 
650 0 |a Machine theory. 
650 0 |a Semiotics. 
650 1 4 |a Mathematical Logic and Foundations. 
650 2 4 |a Formal Languages and Automata Theory. 
650 2 4 |a Semiotics. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9788847023628 
776 0 8 |i Printed edition:  |z 9788847023604 
830 0 |a La Matematica per il 3+2,  |x 2038-5757 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-88-470-2361-1  |z Texto Completo 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713) 

Ejemplares similares