Capturing Bisimulation-Invariant Exponential-Time Complexity Classes

by   Florian Bruse, et al.
Universität Kassel

Otto's Theorem characterises the bisimulation-invariant PTIME queries over graphs as exactly those that can be formulated in the polyadic mu-calculus, hinging on the Immerman-Vardi Theorem which characterises PTIME (over ordered structures) by First-Order Logic with least fixpoints. This connection has been extended to characterise bisimulation-invariant EXPTIME by an extension of the polyadic mu-calculus with functions on predicates, making use of Immerman's characterisation of EXPTIME by Second-Order Logic with least fixpoints. In this paper we show that the bisimulation-invariant versions of all classes in the exponential time hierarchy have logical counterparts which arise as extensions of the polyadic mu-calculus by higher-order functions. This makes use of the characterisation of k-EXPTIME by Higher-Order Logic (of order k+1) with least fixpoints, due to Freire and Martins.


page 1

page 2

page 3

page 4


Superposition with Lambdas

We designed a superposition calculus for a clausal fragment of extension...

Bisimulation Invariant Monadic-Second Order Logic in the Finite

We consider bisimulation-invariant monadic second-order logic over vario...

Lash 1.0 (System Description)

Lash is a higher-order automated theorem prover created as a fork of the...

Descriptive Complexity of Deterministic Polylogarithmic Time

We propose a logical characterization of problems solvable in determinis...

The Expressive Power of Higher-Order Datalog

A classical result in descriptive complexity theory states that Datalog ...

Comparing and evaluating extended Lambek calculi

Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus,...

Polymorphism and the obstinate circularity of second order logic: a victims' tale

The investigations on higher-order type theories and on the related noti...

Please sign up or login with your details

Forgot password? Click here to reset