On the Number of Quantifiers as a Complexity Measure

06/30/2022
by   Ronald Fagin, et al.
0

In 1981, Neil Immerman described a two-player game, which he called the "separability game" <cit.>, that captures the number of quantifiers needed to describe a property in first-order logic. Immerman's paper laid the groundwork for studying the number of quantifiers needed to express properties in first-order logic, but the game seemed to be too complicated to study, and the arguments of the paper almost exclusively used quantifier rank as a lower bound on the total number of quantifiers. However, last year Fagin, Lenchner, Regan and Vyas rediscovered the games, provided some tools for analyzing them, and showed how to utilize them to characterize the number of quantifiers needed to express linear orders of different sizes. In this paper, we push forward in the study of number of quantifiers as a bona fide complexity measure by establishing several new results. First we carefully distinguish minimum number of quantifiers from the more usual descriptive complexity measures, minimum quantifier rank and minimum number of variables. Then, for each positive integer k, we give an explicit example of a property of finite structures (in particular, of finite graphs) that can be expressed with a sentence of quantifier rank k, but where the same property needs 2^Ω (k^2) quantifiers to be expressed.

READ FULL TEXT

page 1

page 13

page 21

page 23

page 25

research
01/22/2018

Even flying cops should think ahead

We study the entanglement game, which is a version of cops and robbers, ...
research
04/30/2021

Multi-Structural Games and Number of Quantifiers

We study multi-structural games, played on two sets 𝒜 and ℬ of structure...
research
07/23/2022

A very sharp threshold for first order logic distinguishability of random graphs

In this paper we find an integer h=h(n) such that the minimum number of ...
research
06/29/2019

On the number of resolvable Steiner triple systems of small 3-rank

In a recent work, Jungnickel, Magliveras, Tonchev, and Wassermann derive...
research
07/09/2019

Characterising Probabilistic Alternating Simulation for Concurrent Games

Probabilistic game structures combine both nondeterminism and stochastic...
research
05/30/2018

On the influence of the interaction graph on a finite dynamical system

A finite dynamical system (FDS) is a system of multivariate functions ov...
research
10/12/2018

Granularity of wagers in games and the (im)possibility of savings

In a casino where arbitrarily small bets are admissible, any betting str...

Please sign up or login with your details

Forgot password? Click here to reset