Quine's Fluted Fragment Revisited
arXiv: Logic in Computer Science, Volume abs/1812.06440, 2018.
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, ...More
Full Text (Upload PDF)
PPT (Upload PPT)