Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/140548
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorGispert Brasó, Joan-
dc.contributor.authorPlanagumà Franco, Marta-
dc.date.accessioned2019-09-20T10:22:59Z-
dc.date.available2019-09-20T10:22:59Z-
dc.date.issued2019-01-18-
dc.identifier.urihttp://hdl.handle.net/2445/140548-
dc.descriptionTreballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Joan Gispert Brasóca
dc.description.abstract[en] Completeness theorem establishes a correspondence between semantic and syntactic interpretations of mathematical logic. In this thesis we will construct canonical models in order to prove the completeness of the weakest normal modal logic, K. This construction will be useful to prove completeness theorems for other logics.ca
dc.format.extent49 p.-
dc.format.mimetypeapplication/pdf-
dc.language.isocatca
dc.rightscc-by-nc-nd (c) Marta Planagumà Franco, 2019-
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.sourceTreballs Finals de Grau (TFG) - Matemàtiques-
dc.subject.classificationTeorema de Gödelca
dc.subject.classificationTreballs de fi de grau-
dc.subject.classificationModalitat (Lògica)ca
dc.subject.classificationLògica matemàticaca
dc.subject.otherGödel's theoremen
dc.subject.otherBachelor's theses-
dc.subject.otherModality (Logic)en
dc.subject.otherMathematical logicen
dc.titleAplicació dels models canònics a la demostració del teorema de completesaca
dc.typeinfo:eu-repo/semantics/bachelorThesisca
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
memoria.pdfMemòria372.31 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons