Search
Now showing items 1-1 of 1
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 ...