Search
Now showing items 1-2 of 2
Undecidability of Some Substructural Logics
Nerozhodnutelnost některých substrukturálních logik
dissertation thesis (DEFENDED)
Advisor: Bílková, Marta
Date Issued: 2015
Date of defense: 10. 06. 2015
Faculty / Institute: Filozofická fakulta / Faculty of Arts
Abstract: Tato disertační práce se zabývá algoritmickou nerozhodnutelností (neřešitel- ností) dokazatelnosti v některých neklasických logikách. Ve skutečnosti existují dvě přirozené varianty toho problému. Mějme dánu logiku, pak ...
This thesis deals with the algorithmic undecidability (unsolvability) of provability in some non-classical logics. In fact, there are two natural variants of this problem. Fix a logic, we can study its set of theorems or ...
This thesis deals with the algorithmic undecidability (unsolvability) of provability in some non-classical logics. In fact, there are two natural variants of this problem. Fix a logic, we can study its set of theorems or ...
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) ...