LIPIcs.STACS.2021.3.pdf
- Filesize: 341 kB
- 1 pages
Document
On the Fluted Fragment (Invited Talk)
Author
Lidia Tendera 
-
Part of:
Volume:
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2021-03-10
File
Document Identifiers
Author Details
Cite As Get BibTex
Lidia Tendera. On the Fluted Fragment (Invited Talk). In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.STACS.2021.3
Abstract
The fluted fragment is a recently rediscovered decidable fragment of first-order logic whose history is dating back to Quine and the sixties of the 20th century. The fragment is defined by fixing simultaneously the order in which variables occur in atomic formulas and the order of quantification of variables; no further restrictions concerning e.g. the number of variables, guardedness or usage of negation apply. In the talk we review some motivation and the history of the fragment, discuss the differences between the fluted fragment and other decidable fragments of first-order logic, present its basic model theoretic and algorithmic properties, and discuss recent work concerning limits of decidability of its extensions.
Subject Classification
ACM Subject Classification
- Theory of computation → Complexity theory and logic
- Theory of computation → Finite Model Theory
Keywords
- decidability
- fluted fragment
- first-order logic
- complexity
- satisfiability
- non-elementary
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads