Definability and model checking: the role of orders and compositionality

Abstract

Finite model theory and descriptive complexity theory are concerned with assessing the expressive power of logics over finite models and with relating the descriptive resources needed for defining a class of structures to the computational complexity of the corresponding decision problem. In recent years, also the model theory and computational handling (e… (More)

Topics

15 Figures and Tables

Slides referencing similar topics