Search
Now showing items 1-2 of 2
Gentzenov dôkaz bezespornosti aritmetiky
Gentzen's Consistency Proof
Gentzenův důkaz bezespornosti aritmetiky
diploma thesis (DEFENDED)
Advisor: Švejdar, Vítězslav
Date Issued: 2011
Date of defense: 30. 06. 2011
Faculty / Institute: Filozofická fakulta / Faculty of Arts
Abstract: Práca podáva podrobne vysvetlené dva dôkazy bezespornosti Peanovej aritmetiky, ktoré v rokoch 1936 a 1938 uverejnil nemecký matematik Gerhard Gentzen. Dôkazy boli naštudované z pôvodných zdrojov, a to z článkov "Die ...
This paper contains detailed description of two consistency proofs, which state that in the system called Peano arithmetic no contradiction can be obtained. The proofs were first published in 1936 and 1938 by the German ...
This paper contains detailed description of two consistency proofs, which state that in the system called Peano arithmetic no contradiction can be obtained. The proofs were first published in 1936 and 1938 by the German ...
Logical background of forcing
Logické základy forcingu
diploma thesis (DEFENDED)
Advisor: Honzík, Radek
Date Issued: 2013
Date of defense: 19. 09. 2013
Faculty / Institute: Filozofická fakulta / Faculty of Arts
Abstract: V předložené práci zkoumáme forcing jako metodu teorie množin a zaměřu- jeme se na okolnosti, které jsou při obvyklých výkladech a aplikacích forcingu ponechávány stranou. Ukážeme, že forcing lze formalizovat v Peanově ...
This thesis examines the method of forcing in set theory and focuses on aspects that are set aside in the usual presentations or applications of forcing. It is shown that forcing can be formalized in Peano arithmetic (PA) ...
This thesis examines the method of forcing in set theory and focuses on aspects that are set aside in the usual presentations or applications of forcing. It is shown that forcing can be formalized in Peano arithmetic (PA) ...