Gispert Brasó, JoanPlanagumà Franco, Marta2019-09-202019-09-202019-01-18https://hdl.handle.net/2445/140548Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Joan Gispert Brasó[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.49 p.application/pdfcatcc-by-nc-nd (c) Marta Planagumà Franco, 2019http://creativecommons.org/licenses/by-nc-nd/3.0/es/Teorema de GödelTreballs de fi de grauModalitat (Lògica)Lògica matemàticaGödel's theoremBachelor's thesesModality (Logic)Mathematical logicinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess