0000000001037032

AUTHOR

Wieslaw Szwast

showing 2 related works from this author

Quine’s Fluted Fragment is Non-elementary

2016

We study the fluted fragment, a decidable fragment of first-order logic with an unbounded number of variables, originally identified 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, for all m greater than 1, the intersectionof the fluted fragment and the m-variable fragment of first-order logic. We show that this subfragment forces (m/2)-tuply exponentially large models, and that its satisfiability problem is (m/2)-NExpTime-hard. We round off by using a corrected version of Purdy’s construction to show that the m-variable fluted f…

060201 languages & linguistics000 Computer science knowledge general worksdecidabilityQuinefluted fragment06 humanities and the arts02 engineering and technologysatisfiabilityPurdy0602 languages and literatureComputer Science0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingnon-elementary
researchProduct

FO^2 with one transitive relation is decidable

2013

We show that the satisfiability problem for the two-variable first-order logic, FO^2, over transitive structures when only one relation is required to be transitive, is decidable. The result is optimal, as FO^2 over structures with two transitive relations, or with one transitive and one equivalence relation, are known to be undecidable, so in fact, our result completes the classification of FO^2-logics over transitive structures with respect to decidability. We show that the satisfiability problem is in 2-NExpTime. Decidability of the finite satisfiability problem remains open.

000 Computer science knowledge general worksComputer ScienceComputer Science::Formal Languages and Automata Theory
researchProduct