A double arity hierarchy theorem for transitive closure logic

@article{Grohe1996ADA,
  title={A double arity hierarchy theorem for transitive closure logic},
  author={Martin Grohe and Lauri Hella},
  journal={Archive for Mathematical Logic},
  year={1996},
  volume={35},
  pages={157-171}
}
In this paper we prove that thek-ary fragment of transitive closure logic is not contained in the extension of the (k−1)-ary fragment of partial fixed point logic by all (2k−1)-ary generalized quantifiers. As a consequence, the arity hierarchies of all the familiar forms of fixed point logic are strict simultaneously with respect to the arity of the induction predicates and the arity of generalized quantifiers.Although it is known that our theorem cannot be extended to the sublogic… 
Arity and alternation: a proper hierarchy in higher order logics
TLDR
It is shown that, for every i ≥ 1, the resulting $\mathit{AA}^i(r,m)$ hierarchy of formulae of (i +‬1)-th order logic is proper, which extends a result by Makowsky and Pnueli who proved that the same hierarchy in second-order logic is Proper.
Arity and Alternation: A Proper Hierarchy in Higher Order Logics
TLDR
It is shown that, for every i ≥ 1, the resulting AAi(r,m) hierarchy of formulae of (i + 1 )-th order logic is proper, and this extends a result by J. Makowsky and Y. Pnueli who proved that the same hierarchy in second-order logic is Proper.
Quantifiers and Logical Reductions
TLDR
In Chapter 6 it was seen that least fixed-point logic FO(LFP) captures PTIME, but does not strongly capture PTIME; the question is whether there is any “natural” logic strongly capturing PTIME.
Vectorization hierarchies of some graph quantifiers
TLDR
A sufficient condition for the inexpressibility of the k-th extended vectorization of a generalized quantifier $\sf Q$ in ${\rm FO}({\vec Q}_k)$ is given.
Expressibility of higher-order logics on relational databases : proper hierarchies : a dissertation presented in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Information Systems at Massey University, Wellington, New Zealand
We investigate the expressive power of different fragments of higher-order logics over finite relational structures (or equivalently, relational databases) with special emphasis in higher-order
Generalized Quantifiers
TLDR
Main emphasis is on definability issues, such as whether there is a logic for the PTIME properties of unordered finite models, and the methods that are available in this area.
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes
TLDR
It is shown that the class of problems RFDPS properly contains theclass of problems definable in inflationary fixed-point logic, and that there is a strict, infinite hierarchy of classes of problems withinRFDPS parameterized by the depth of nesting of forall-loops in the program schemes.
Generalized Quantifiers, an Introduction
TLDR
Main emphasis is on definability issues, such as whether there is a logic for the PTIME properties of unordered finite models, and the methods that are available in this area.

References

SHOWING 1-10 OF 10 REFERENCES
Arity Hierarchies
  • Martin Grohe
  • Mathematics, Computer Science
    Ann. Pure Appl. Log.
  • 1996
On the Power of Deterministic Transitive Closures
Abstract We show that transitive closure logic (FO + TC) is strictly more powerful than deterministic transitive closure logic (FO + DTC) on finite (unordered) structures. In fact, on certain classes
Complete Problems for Fixed-Point Logics
TLDR
This class gives a natural description of the fixed-point process of an inductive fix-point formula and hence sheds some light on completely different aspects of the logic than Dahlhaus's construction, which is strongly based on the features of least fixed- point formulae.
Logical Hierarchies in PTIME
  • L. Hella
  • Computer Science, Philosophy
    Inf. Comput.
  • 1996
TLDR
It is proved that, for each natural numbern, there is a polynomial time computable query which is not definable in any extension of fixpoint logic by any set of generalized quantifiers, which rules out the possibility of characterizing PTIME in terms of definability in fix point logic extended by a finite set of universal quantifiers.
Languages that Capture Complexity Classes
  • N. Immerman
  • Computer Science, Mathematics
    SIAM J. Comput.
  • 1987
TLDR
It is shown that projection translations are a uniform version of Valiant’s projections, and that the usual complete problems remain complete via these very restrictive reductions.
Annals of Pure and Applied Logic
TLDR
A new process logic is defined, called computation paths logic (CPL), which treats lbnn~~la~ and programs essentially alike and is decidable in elementary tlmc, and also ofrcr extensions for modeling asynchronouaisynchronous concurrency and infinite computanons.
Definability Hierarchies of Generalized Quantifiers
  • L. Hella
  • Philosophy
    Ann. Pure Appl. Log.
  • 1989
Stationary logic and its friends. II
Chaque phrase Lω 1 (Q) consistante a un modele F-determine (F est un fragment denombrable de Lω1ω(aa)); et il est consistant que L(Q) a la propriete de Beth faible
The Structure of Fixed–Point Logics
  • The Structure of Fixed–Point Logics
  • 1994
The logic of divisibility
  • The logic of divisibility
  • 1994