Research > Task VIII: Finite model theory and links to computer science
Task VIII: Finite model theory and links to computer science
VIII.1: Preservation theorems on restricted classes of structures
a) Modal and guarded fragments, with links to graph and hypergraph theory.
a) Positive primitive definability and homomorphisms of finite structures.
a) Develop a descriptive complexity of subexponential time solvability and explore connections with parameterized complexity theory.
Years 1 and 2, Years 3 and 4.
|Last updated: September 9 2009 15:55||Please send your corrections to:|