By virtue of the close relationship between logic and relational databases, it turns out that complexity has important applications to databases such as analyzi

From the Preface: We hope that this small volume will suggest directions of synergy and contact for future researchers to build upon, creating connections and m

This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.

The book is based on the PhD thesis “Descriptive Set Theoretic Methods in Automata Theory,” awarded the E.W. Beth Prize in 2015 for outstanding dissertation

This collection brings together the authors' previous research with new work on the Register-Functional (RF) approach to grammatical complexity, offering a unif