Original title: Aritmetická úplnost logiky R
Translated title: Arithmetical completeness of the logic R
Authors: Holík, Lukáš ; Švejdar, Vítězslav (advisor) ; Bílková, Marta (referee)
Document type: Master’s theses
Year: 2014
Language: cze
Abstract: [cze] [eng]
Cílem práce bylo s použitím novodobé notace vystavět teorii Rosserovy logiky, vysvětlit do detailu její vztah s Peanovou aritmetikou, ukázat kripkovskou sémantiku a nakonec pomocí autoreference v množném čísle zpracovat důkaz aritmetické úplnosti. V poslední kapitole se pak ukazují některé z vlastností rosserovských sentencí. Powered by TCPDF (www.tcpdf.org) The aim of this work is to use contemporary notation to build theory of Rosser logic, explain in detail its relation to Peano arithmetic, show its Kripke semantics and finally using plural self-reference show the proof of arithmetical completeness. In the last chapter we show some of the properties of Rosser sentences. Powered by TCPDF (www.tcpdf.org)
Keywords: fixed point; modal logics; Provability logic; Rosser modalities; Logika dokazatelnosti; modální logiky; pevný bod; rosserovské modality

Institution: Charles University Faculties (theses) (web)
Document availability information: Available in the Charles University Digital Repository.
Original record: http://hdl.handle.net/20.500.11956/72212

Permalink: http://www.nusl.cz/ntk/nusl-341334


The record appears in these collections:
Universities and colleges > Public universities > Charles University > Charles University Faculties (theses)
Academic theses (ETDs) > Master’s theses