Query languages with counters

Purchase on Springer.com

$29.95 / €24.95 / £19.95*

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We investigate the expressive power of query languages with counting ability. We define a LOGSPACE extension of first order logic and a PTIME extension of fixpoint logic with counters. We develop specific techniques, such as games, for dealing with languages with counters and therefore integers. We prove in particular that the arity of the tuples which are counted induces a strict expressivity hierarchy. We also establish results about the asymptotic probabilities of sentences with counters. In particular we show that first order logic with comparison of the cardinalities of relations has a. 0/1 law.