β Scribed by Edith Spaan
No coin nor oath required. For personal study only.
This is a doctoral dissertation of Edith Spaan under the supervision of prof. Johan van Benthem.
Cover ......Page 1
Dankwoord ......Page 4
Table of contents ......Page 5
1 Introduction ......Page 6
2.1 A Bit of Modal Logic ......Page 10
2.2 A Bit of Complexity ......Page 15
2.3 Tiling Problems ......Page 23
2.4 Towards General Modal Complexity Results ......Page 25
3.1 Introduction ......Page 28
3.2 Upper Bound Transfer ......Page 29
3.3 The Power of the Join ......Page 35
3.4 Classification ......Page 41
3.5 The Complexity of the General Join ......Page 48
3.6 The Structure of the Join of Frames ......Page 53
4.1 Introduction ......Page 56
4.2 Upper Bounds ......Page 57
4.3 Lower Bounds ......Page 63
4.4 Classification ......Page 65
5.1 Introduction ......Page 72
5.2 Attribute Value Logic ......Page 73
5.3 Complexity Results for L, LN and LKR ......Page 81
5.4 The Universal Modality ......Page 85
5.5 The Master Modality ......Page 95
5.6 Concluding Remarks ......Page 99
6.1 Introduction ......Page 102
6.2 Syntax and Semantics ......Page 103
6.3 From Points to Intervals ......Page 105
6.4 Forcing Models to be Gridlike ......Page 106
6.5 Variations on a Theme by Ladner and Reif ......Page 114
6.6 A Generic Reduction from Linear to Branching Time ......Page 120
Bibliography ......Page 124
Samenvatting ......Page 130
π SIMILAR VOLUMES
This is a doctoral dissertation of Edith Spaan under the supervision of prof. Johan van Benthem.
In this thesis we investigate modal logics from a lattice theoretic point of view. There are essentially two well-known methods of research on lattices of modal logics. The investigation of the lattice of modal logics as a whole, and the local investigation of the lattice of extensions of some stron
In this thesis we investigate modal logics from a lattice theoretic point of view. There are essentially two well-known methods of research on lattices of modal logics. The investigation of the lattice of modal logics as a whole, and the local investigation of the lattice of extensions of some stron
This thesis takes an algorithmic perspective on the correspondence between modal and hybrid logics on the one hand, and first-order logic on the other. The canonicity of formulae, and by implication the completeness of logics, is simultaneously treated. Modal formulae define second-order condit
This dissertation is about extending modal logic. It tells you what a system of extended modal logic is, it gives you three case studies of systems of modal logic, and it gives you very general approaches to two important themes in modal logic.