In database theory, the term database transformation was used to refer to a unifying
treatment for computable queries and updates. Recently, it was shown that non-deterministic …

Let SO plog denote the restriction of second-order logic, where second-order quantification
ranges over relations of size at most poly-logarithmic in the size of the structure. In this article …

We define new fragments of higher-order logics of order three and above, and investigate
their expressive power over finite models. The key unifying property of these fragments is …

Graph algorithms that involve complex conditions on subgraphs can be specified much
easier, if the specification allows expressions in higher-order logic to be used. In this paper …

In the framework of computable queries in Database Theory, there are many examples of
queries to (properties of) relational database instances that can be expressed by simple and …

During the last forty years logics over nite structures have become a central pillar for
studying the denability and complexity of computational problems. The focus is on …

Second-order transitive-closure logic, SO (TC), is an expressive declarative language that
captures the complexity class PSPACE. Already its monadic fragment, MSO (TC), allows the …

In database theory, the term database transformation was used to refer to a unifying
treatment for computable queries and updates. Recently, it was shown that non-deterministic …