We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham e-Theses
You are in:

Applications of Finite Model Theory: Optimisation Problems, Hybrid Modal Logics and Games.

GATE, JAMES,SIMON (2013) Applications of Finite Model Theory: Optimisation Problems, Hybrid Modal Logics and Games. Doctoral thesis, Durham University.

PDF - Accepted Version
Available under License Creative Commons Attribution 3.0 (CC BY).



There exists an interesting relationships between two seemingly distinct fields: logic from the field of Model Theory, which deals with the truth of statements about discrete structures; and Computational Complexity, which deals with the classification of problems by how much of a particular computer resource is required in order to compute a solution. This relationship is known as Descriptive Complexity and it is the primary application of the tools from Model Theory when they are restricted to the finite; this restriction is commonly called Finite Model Theory.

In this thesis, we investigate the extension of the results of Descriptive Complexity from classes of decision problems to classes of optimisation problems. When dealing with decision problems the natural mapping from true and false in logic to yes and no instances of a problem is used but when dealing with optimisation problems, other features of a logic need to be used. We investigate what these features are and provide results in the form of logical frameworks that can be used for describing optimisation problems in particular classes, building on the existing research into this area.

Another application of Finite Model Theory that this thesis investigates is the relative expressiveness of various fragments of an extension of modal logic called hybrid modal logic. This is achieved through taking the Ehrenfeucht-Fraïssé game from Model Theory and modifying it so that it can be applied to hybrid modal logic. Then, by developing winning strategies for the players in the game, results are obtained that show strict hierarchies of expressiveness for fragments of hybrid modal logic that are generated by varying the quantifier depth and the number of proposition and nominal symbols available.

Item Type:Thesis (Doctoral)
Award:Doctor of Philosophy
Keywords:Logic Computational Complexity Optimisation Finite Model Theory Modal Logic Games
Faculty and Department:Faculty of Science > Engineering and Computing Science, School of
Thesis Date:2013
Copyright:Copyright of this thesis is held by the author
Deposited On:21 May 2013 11:06

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitter