DeepAI AI Chat
Log In Sign Up

Quine's Fluted Fragment Revisited

12/16/2018
by   I. Pratt-Hartmann, et al.
The University of Manchester
Uniwersytet Opolski
0

We study the fluted fragment, a decidable fragment of first-order logic with an unbounded number of variables, originally identified in 1968 by W.V. Quine. We show that the satisfiability problem for this fragment has non-elementary complexity, thus refuting an earlier published claim by W.C. Purdy that it is in NExpTime. More precisely, we consider FL^m, the intersection of the fluted fragment and the m-variable fragment of first-order logic, for all m ≥ 1. We show that, for m ≥ 2, this sub-fragment forces m/2-tuply exponentially large models, and that its satisfiability problem is m/2-NExpTime-hard. We further establish that, for m ≥ 3, any satisfiable FL^m-formula has a model of at most (m-2)-tuply exponential size, whence the satisfiability (= finite satisfiability) problem for this fragment is in (m-2)-NExpTime. Together with other, known, complexity results, this provides tight complexity bounds for FL^m for all m ≤ 4.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/22/2023

The Logic of Prefixes and Suffixes is Elementary under Homogeneity

In this paper, we study the finite satisfiability problem for the logic ...
01/21/2021

Finite Model Theory of the Triguarded Fragment and Related Logics

The Triguarded Fragment (TGF) is among the most expressive decidable fra...
04/25/2018

On the satisfiability problem for fragments of the two-variable logic with one transitive relation

We study the satisfiability problem for the two-variable first-order log...
02/01/2018

On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic

This paper investigates the satisfiability problem for Separation Logic,...
05/04/2023

On the of Limits of Decision: the Adjacent Fragment of First-Order Logic

We define the adjacent fragment AF of first-order logic, obtained by res...
08/31/2020

SHACL Satisfiability and Containment (Extended Paper)

The Shapes Constraint Language (SHACL) is a recent W3C recommendation la...
06/01/2020

Two variable logic with ultimately periodic counting

We consider the extension of two variable logic with quantifiers that st...