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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Mundici, Daniele, 1946-
Format: Livre numérique
Sprache:Anglais
Veröffentlicht: Milano : Springer Milan [20..].
Cham : Springer Nature
Ausgabe:1st ed. 2012.
Schriftenreihe:La Matematica per il 3+2
Schlagworte:
Online Zugang:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Anmerkung: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Logic, Texte imprimé, 978-88-470-2360-4
• Logic: a Brief Course, Texte imprimé, 9788847023628
• Logic: a Brief Course, Texte imprimé, 9788847023604
• Logic: a Brief Course, Texte imprimé, 9788847023628
• Logic: a Brief Course, Texte imprimé, 9788847023604
LEADER 04035nam a22004217a 4500
001 958463
008 130325q2000 xxe ||| |||| 00| 0 eng d
009 PPN168333678
020 |a 9788847023611 
041 0 |a eng 
082 |a 511.3 
100 1 |a Mundici, Daniele,  |d 1946- 
245 1 0 |a Logic :  |b a brief course   |c by Daniele Mundici. 
250 |a 1st ed. 2012. 
260 |a Milano :  |b Springer Milan. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a La Matematica per il 3+2  |x 2038-5757 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 1 |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 
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 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
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 |a Logique symbolique et mathématique 
650 |a Informatique 
650 |a Langages formels 
776 0 |t Logic  |b Texte imprimé  |z 978-88-470-2360-4 
776 0 |t Logic: a Brief Course  |b Texte imprimé  |z 9788847023628 
776 0 |t Logic: a Brief Course  |b Texte imprimé  |z 9788847023604 
776 0 |t Logic: a Brief Course  |b Texte imprimé  |z 9788847023628 
776 0 |t Logic: a Brief Course  |b Texte imprimé  |z 9788847023604 
856 4 |q PDF  |u https://doi.org/10.1007/978-88-470-2361-1  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-6S0W6SLN-S  |z Accès sur la plateforme Istex 
856 4 |5 452349901:749142901  |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-88-470-2361-1  |z Accès Université d'Orléans 
856 4 |5 180339901:752152157  |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-88-470-2361-1  |z Accès INSA CVL 
997 |0 958463  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/