|
|
Importance of United Nations Security Council and binding effect of resolutions in maintenance of international peace and security
Urbanová, Petra ; Ondřej, Jan (advisor) ; Balaš, Vladimír (referee)
- Importance of United Nations Security Council and binding effect of resolutions in maintenance of international peace and security This paper depicts the history previous to creation and the creation itself of UN and the Security Council, followed by chapter devoted to the permanent and non- permanent members of the Council with subchapter about reform proposals in terms of its composition. Then there is detailed description of functions and powers of the Security Council, including also a topic relating to the Council's period of paralysis. In the chapter on voting procedure there is stressed the crucial issue of distinguishing procedural and non-procedural resolutions with talking about veto power as well. The final chapter is devoted to the decisions of the Security Council with focus on resolutions and their binding effect.
|
|
|
The trial of Milada Horáková in the context of contemporary publicity campaign
Srb, Petr ; Jančík, Drahomír (advisor) ; Jakubec, Ivan (referee)
The work is an analysis of contemporary propaganda methods of the ruling power and their effects on the Czech and Slovak population. It is set in the wider context of the times. The focus is on resolutions and their analysis. Contemporary journalism is reflected and detailed comparison of the percentage of thematic articles on the pages of two selected journals is attempted . The work is mainly based on archival material referring to the trial of Milada Horakova , this material is located at the National Archives in Prague . The work si also based on journalism of that time and build on contemporary scholarly historical literature Key words: Milada Horáková, political processes, resolution
|
|
|
Finding Minimum Satisfying Assignments of Boolean Formulas
Švancara, Jiří ; Balyo, Tomáš (advisor) ; Trunda, Otakar (referee)
In this thesis we examine algorithms and techniques used for solving Boolean satisfiability (SAT). Then we inspect the possibility to use them in solving the weighted short SAT problem, which is a generalization of the satisfiability problem. Given that each variable has a weight, this generalization is the problem of finding a satisfying truth assignment while using the smallest sum of weights. To solve this problem, we introduce three truth assignments of variables - True, False and Unassign. We show that not all algorithms and techniques used in modern SAT solvers can be used in our program. Those that can be converted, will be implemented using our three truth assignments. This will yield several versions of our new solver, which will be compared. Powered by TCPDF (www.tcpdf.org)
|
|
|
On the Power of Weak Extensions of V0
Müller, Sebastian Peter ; Krajíček, Jan (advisor) ; Thapen, Neil (referee) ; Kolodziejczyk, Leszek (referee)
Název práce: O síle slabých rozšírení teorie V0 Autor: Sebastian Müller Katedra: Katedra Algebry Vedoucí disertační práce: Prof. RNDr. Jan Krajíček, DrSc., Katedra Algebry. Abstrakt: V predložené disertacní práci zkoumáme sílu slabých fragmentu arit- metiky. Činíme tak jak z modelově-teoretického pohledu, tak z pohledu důkazové složitosti. Pohled skrze teorii modelu naznačuje, že malý iniciální segment libo- volného modelu omezené aritmetiky bude modelem silnější teorie. Jako příklad ukážeme, že každý polylogaritmický řez modelu V0 je modelem VNC. Užitím známé souvislosti mezi fragmenty omezené aritmetiky a dokazatelností v ro- zličných důkazových systémech dokážeme separaci mezi rezolucí a TC0 -Frege systémem na náhodných 3CNF-formulích s jistým poměrem počtu klauzulí vůci počtu proměnných. Zkombinováním obou výsledků dostaneme slabší separační výsledek pro rezoluci a Fregeho důkazové systémy omezené hloubky. Klíčová slova: omezená aritmetika, důkazová složitost, Fregeho důkazový systém, Fregeho důkazový systém omezené hloubky, rezoluce Title: On the Power of Weak Extensions of V0 Author: Sebastian Müller Department: Department of Algebra Supervisor: Prof. RNDr. Jan Krajíček, DrSc., Department of Algebra....
|
|
|
Implementation of the mandate of the UNPROFOR mission in Bosnia and Herzegovina between 1992-1995
Lalić, Jan ; Tejchman, Miroslav (advisor) ; Pikal, Kamil (referee)
The unwillingness of the international community to become involved militarily in Bosnian civil war between 1992-1995, made the United Nations Protection Force (UNPROFOR) a substitute for a decisive action. The absence of any foreseeable prospect of truce, which would have been supported by the presence of peacekeepers, led to the establishment of strictly humanitarian mandate for UN troops in the first phase of the war. They were supposed, in cooperation with the United Nations High Commisioner for Refugees (UNHCR), to secure functioning of the Sarajevo airport for humanitarian relief purposes and subsequently provide security for the UNHCR and its convoys providing humanitarian relief. Thesis "Implementation of the mandate of the UNPROFOR mission in Bosnia and Herzegovina between 1992-1995" deals with issues concerning humanitarian mandate in particular. This thesis aims to explain, through descriptive analysis, motives leading international community to deploy lightely armed peacekeeprs with uncharacteristic mandate to the region, which is absolutely inadequate for peacekeeping operations as I will show. It will subsequently analyze course of the implementation and problems, which were encountered by UN troops. The aim of this thesis is to prove, that UNPROFOR was not absolute failure as it is perceived,...
|
|
|
Methods of proving lower bounds in propositional logic
Peterová, Alena ; Pudlák, Pavel (advisor) ; Krajíček, Jan (referee)
In the present work, we study the propositional proof complexity. First, we prove an exponential lower bound on the complexity of resolution applying directly Razborov's approximation method, which was previously used only for bounds on the size of monotone circuits. Next, we use the approximation method for a new proof of an exponential lower bound on the complexity of random resolution refutations. That should have further applications in separating some theories in bounded arithmetic. In both cases, we use a problem from the graph theory called Broken Mosquito Screens. Finally, we state a conjecture that the approximation method is applicable even for stronger propositional proof systems, for example Cutting Plane Proofs. Powered by TCPDF (www.tcpdf.org)
|
guest ::
