Complete problems for higher order logics

• Authors: Lauri Hella;José María Turull-Torres
• Venue: CSL'06 Proceedings of the 20th international conference on Computer Science Logic
• Year: 2006

Let i, j ≥1, and let Σ$^{i}_{j}$ denote the class of the higher order logic formulas of order i+1 with j–1 alternations of quantifier blocks of variables of order i+1, starting with an existential quantifier block. There is a precise correspondence between the non deterministic exponential time hierarchy and the different fragments of higher order logics Σ$^{i}_{j}$, namely NEXP$^{j}_{i}$ = Σ$^{i+1}_{j}$. In this article we present a complete problem for each level of the non deterministic exponential time hierarchy, with a very weak sort of reductions, namely quantifier-free first order reductions. Moreover, we don’t assume the existence of an order in the input structures in this reduction. From the logical point of view, our main result says that every fragment Σ$^{i}_{j}$ of higher order logics can be captured with a first order logic Lindström quantifier. Moreover, as our reductions are quantifier-free first order formulas, we get a normal form stating that each Σ$^{i}_{j}$ sentence is equivalent to a single occurrence of the quantifier and a tuple of quantifier-free first order formulas. Our complete problems are a generalization of the well known problem quantified Boolean formulas with bounded alternation (QBFj).