Research > Task VIII: Finite model theory and links to computer science
Task VIII: Finite model theory and links to computer science
Description
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. Progress Years 1 and 2, Years 3 and 4. |
Last updated: March 23 2021 09:23 | Please send your corrections to: |