LIPIcs.MFCS.2019.18.pdf
- Filesize: 0.69 MB
- 15 pages
Document
The Fluted Fragment with Transitivity
Authors
Ian Pratt-Hartmann 
,
Lidia Tendera
-
Part of:
Volume:
44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Mathematical Foundations of Computer Science (MFCS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2019-08-20
File
Document Identifiers
Author Details
- University of Warsaw, Poland
- University of Opole, Poland
- University of Manchester, UK
Cite AsGet BibTex
Ian Pratt-Hartmann and Lidia Tendera. The Fluted Fragment with Transitivity. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 18:1-18:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.MFCS.2019.18
https://doi.org/10.4230/LIPIcs.MFCS.2019.18
Abstract
We study the satisfiability problem for the fluted fragment extended with transitive relations. We show that the logic enjoys the finite model property when only one transitive relation is available. On the other hand we show that the satisfiability problem is undecidable already for the two-variable fragment of the logic in the presence of three transitive relations.
Subject Classification
ACM Subject Classification
- Theory of computation → Complexity theory and logic
- Theory of computation → Finite Model Theory
Keywords
- First-Order logic
- Decidability
- Satisfiability
- Transitivity
- Complexity
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads