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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.