Abstract
The Feferman–Vaught theorem provides a way of evaluating a first order sentence \(\varphi \) on a disjoint union of structures by producing a decomposition of \(\varphi \) into sentences which can be evaluated on the individual structures and the results of these evaluations combined using a propositional formula. This decomposition can in general be non-elementarily larger than \(\varphi \). We introduce a “tree” generalization of the prenex normal form (PNF) for first order sentences, and show that for an input sentence in this form having a fixed number of quantifier alternations, a Feferman–Vaught decomposition can be obtained in time elementary in the size of the sentence. The sentences in the decomposition are also in tree PNF, and further have the same number of quantifier alternations and the same quantifier rank as the input sentence. We extend this result by considering binary operations other than disjoint union, in particular sum-like operations such as join, ordered sum and NLC-sum, that are definable using quantifier-free translation schemes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blumensath, A., Colcombet, T., & Löding, C. (2008). Logical theories and compatible operations. Logic and Automata, 2, 73–106.
Courcelle, B., Makowsky, J. A., & Rotics, U. (2000). Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems, 33(2), 125–150.
Dawar, A., Grohe, M., Kreutzer, S., & Schweikardt, N. (2007). Model theory makes formulas large. In International Colloquium on Automata, Languages, and Programming (pp. 913–924).
Droste, M., & Paul, E. (2018). A feferman-vaught decomposition theorem for weighted mso logic. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
Elberfeld, M., Grohe, M., & Tantau, T. (2016). Where first-order and monadic second-order logic coincide. ACM Transactions on Computational Logic (TOCL), 17(4), 1–18.
Emmer, M., Khasidashvili, Z., Korovin, K., & Voronkov, A. (2010). Encoding industrial hardware verification problems into effectively propositional logic. In Proceedings of Formal Methods in Computer Aided Design, FMCAD 2010, Lugano, Switzerland, October 20–23, 2010 (pp. 137–144).
Fagin, R., Kolaitis, P. G., Miller, R. J., & Popa, L. (2005). Data exchange: Semantics and query answering. Theoretical Computer Science, 336(1), 89–124.
Feferman, S., & Vaught, R. (1959). The first order properties of products of algebraic systems. Fundamenta Mathematicae, 47(1), 57–103.
Frick, M., & Grohe, M. (2004). The complexity of first-order and monadic second-order logic revisited. Annals of Pure and Applied Logic, 130(1–3), 3–31.
Göller, S., Jung, J. C., & Lohrey, M. (2015). The complexity of decomposing modal and first-order theories. ACM Transactions on Computational Logic (TOCL), 16(1), 1–43.
Grohe, M. (2008). Logic, graphs, and algorithms. Logic and Automata, 2, 357–422.
Gulwani, S. (2010). Dimensions in program synthesis. In Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, ACM, PPDP ’10 (pp 13–24).
Haase, C. (2014). Subclasses of Presburger arithmetic and the weak EXP hierarchy. In Proceedings of the joint meeting of the 23rd EACSL annual conference on computer science logic (CSL) and the 29th annual ACM/IEEE symposium on logic in computer science (LICS) (pp. 1–10).
Harwath, F. (2016). A note on the size of Prenex normal forms. Information Processing Letters, 116(7), 443–446.
Harwath, F., Heimberg, L., & Schweikardt, N. (2015). Preservation and decomposition theorems for bounded degree structures. Logical Methods in Computer Science, 11(4), 1. https://doi.org/10.2168/LMCS-11(4:17)2015
Lenzerini, M. (2002). Data integration: A theoretical perspective. In Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, ACM, PODS ’02 (pp. 233–246).
Libkin, L. (2013). Elements of finite model theory. Springer.
Makowsky, J. A. (2004). Algorithmic uses of the Feferman–Vaught theorem. Annals of Pure and Applied Logic, 126(1–3), 159–213.
Mostowski, A. (1952). On direct products of theories. The Journal of Symbolic Logic, 17(1), 1–31.
Piskac, R., de Moura, L. M., & Bjørner, N. (2010). Deciding effectively propositional logic using DPLL and substitution sets. Journal of Automated Reasoning, 44(4), 401–424.
Reddy, C. R., & Loveland, D. W. (1978). Presburger arithmetic with bounded quantifier alternation. In Proceedings of the 10th annual ACM symposium on theory of computing (pp. 320–325).
Sankaran, A. (2018). A generalization of the Łoś–Tarski preservation theorem—Dissertation summary. arXiv:1811.01014
Sankaran, A. (2021). Feferman–Vaught decompositions for prefix classes of first order logic. In ICLA 2021 Proceedings, 9th Indian Conference on Logic and its Applications (pp. 111–116). March 4–7, 2021. https://www.isichennai.res.in/~sujata/icla2021/proceedings.pdf.
Stockmeyer, L. J., & Meyer, A. R. (1973). Word problems requiring exponential time (preliminary report). In Proceedings of the 5th annual ACM symposium on theory of computing, association for computing machinery, New York, NY, USA, STOC ’73 (p. 1–9).
Thomas, W. (1997). Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In Structures in logic and computer science, a selection of essays in honor of A. Ehrenfeucht, number 1261 in lecture notes in computer science (pp. 118–143). Springer.
van Bergerem, S., & Schweikardt, N. (2021). Learning concepts described by weight aggregation logic. In Baier, C., Goubault-Larrecq, J. (Eds) 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, January 25–28, 2021, Ljubljana, Slovenia (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, LIPIcs (Vol. 183, pp. 10:1–10:18).
Wanke, E. (1994). k-nlc graphs and polynomial algorithms. Discrete Applied Mathematics, 54(2–3), 251–266.
Acknowledgements
I thank the anonymous referees of this paper, and those of the conference version of the paper (Sankaran 2021), for their helpful comments in improving the presentation of the results and for pointing to related literature.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Research supported by the Leverhulme Trust through a Research Project Grant on “Logical Fractals”.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Sankaran, A. Feferman–Vaught Decompositions for Prefix Classes of First Order Logic. J of Log Lang and Inf 32, 147–174 (2023). https://doi.org/10.1007/s10849-022-09384-9
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10849-022-09384-9