6533b82cfe1ef96bd12900fa

RESEARCH PRODUCT

The fluted fragment with transitive relations

Lidia TenderaIan Pratt-hartmann

subject

FOS: Computer and information sciencesComputer Science - Logic in Computer ScienceTransitivityTransitive relationLogicFinite model propertyF.4.1; F.2.2DecidabilityExtension (predicate logic)SatisfiabilityLogic in Computer Science (cs.LO)DecidabilityUndecidable problemFluted logicCombinatoricsFragment (logic)03D15F.4.1Order (group theory)F.2.2SatisfiabilityMathematics

description

Abstract The fluted fragment is a fragment of first-order logic (without equality) in which, roughly speaking, the order of quantification of variables coincides with the order in which those variables appear as arguments of predicates. It is known that this fragment has the finite model property. We consider extensions of the fluted fragment with various numbers of transitive relations, as well as the equality predicate. In the presence of one transitive relation (together with equality), the finite model property is lost; nevertheless, we show that the satisfiability and finite satisfiability problems for this extension remain decidable. We also show that the corresponding problems in the presence of two transitive relations (with equality) or three transitive relations (without equality) are undecidable, even for the two-variable sub-fragment.

https://doi.org/10.1016/j.apal.2021.103042