Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Alternating Quantifiers in Uniform One-Dimensional Fragments with an Excursion into Three-Variable Logic (2404.03377v2)

Published 4 Apr 2024 in cs.LO

Abstract: The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment to contexts involving relations of arity greater than two. Quantifiers in this logic are used in blocks, each block consisting only of existential quantifiers or only of universal quantifiers. In this paper we consider the possibility of mixing both types of quantifiers in blocks. We show the finite (exponential) model property and NExpTime-completeness of the satisfiability problem for two restrictions of the resulting formalism: in the first we require that every block of quantifiers is either purely universal or ends with the existential quantifier, in the second we restrict the number of variables to three; in both equality is not allowed. We also extend the second variation to a rich subfragment of the three-variable fragment (without equality) that still has the finite model property and decidable, NExpTime{}-complete satisfiability.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (44)
  1. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27:217–274, 1998. doi:10.1023/A:1004275029985.
  2. Complexity of two-variable logic on finite trees. ACM Trans. Comput. Log., 17(4):32:1–32:38, 2016. doi:10.1145/2996796.
  3. Two-variable logic on data words. ACM Trans. Comput. Log., 12(4):27, 2011. doi:10.1145/1970398.1970403.
  4. On the limits of decision: the adjacent fragment of first-order logic. In 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, volume 261 of LIPIcs, pages 111:1–111:21, 2023. doi:10.4230/LIPICS.ICALP.2023.111.
  5. Herbrand property, finite quasi-herbrand models, and a chandra-merlin theorem for quantified conjunctive queries. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, pages 1–12. IEEE Computer Society, 2017. doi:10.1109/LICS.2017.8005073.
  6. Making cross products and guarded ontology languages compatible. In Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pages 880–886, 2017. doi:10.24963/IJCAI.2017/122.
  7. Two-variable logic on data trees and XML reasoning. J. ACM, 56(3), 2009. doi:10.1145/1516512.1516515.
  8. Guarded negation. J. ACM, 62(3):22, 2015. doi:10.1145/2701414.
  9. Two-variable logic with counting and trees. In 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, pages 73–82, 2013. doi:10.1109/LICS.2013.12.
  10. Two-variable logic with counting and a linear order. In 24th EACSL Annual Conference on Computer Science Logic, CSL 2015,, volume 41 of LIPIcs, pages 631–647, 2015. doi:10.4230/LIPICS.CSL.2015.631.
  11. An excursion to the border of decidability: between two- and three-variable logic. In LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, volume 94 of EPiC Series in Computing, pages 205–223, 2023. doi:10.29007/1XNS.
  12. On the complexity of Maslov class K. In In preparation, 2024.
  13. On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic, 3(1):53–69, 1997. doi:10.2307/421196.
  14. Warren D. Goldfarb. The unsolvability of the Gödel class with identity. J. Symb. Logic, 49:1237–1252, 1984. doi:10.2307/2274274.
  15. Two-variable logic with counting is decidable. In 12th Annual IEEE Symposium on Logic in Computer Science, LICS 1997, pages 306–317. IEEE, 1997. doi:10.1109/LICS.1997.614957.
  16. Random models and the Gödel case of the decision problem. J. Symbolic Logic, 48(4):1120–1124, 1983. doi:10.2307/2273674.
  17. Philip Hall. On representatives of subsets. Journal of the London Mathematical Society, s1-10(1):26–30, 1935. doi:10.1112/jlms/s1-10.37.26.
  18. One-dimensional fragment of first-order logic. In Proceedings of Advances in Modal Logic, 2014, pages 274–293, 2014.
  19. Maslov’s class K revisited. In Automated Deduction — CADE-16, pages 172–186, 1999. doi:10.1007/3-540-48660-7\_12.
  20. Yevgeny Kazakov. Saturation-based decision procedures for extensions of the guarded fragment. PhD thesis, Universität des Saarlandes, Saarbrücken, Germany, 2006.
  21. Emanuel Kieroński. Results on the guarded fragment with equivalence or transitive relations. In 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, volume 3634 of LNCS, pages 309–324. Springer, 2005. doi:10.1007/11538363\_22.
  22. Emanuel Kieronski. One-dimensional guarded fragments. In 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, volume 138 of LIPIcs, pages 16:1–16:14, 2019. doi:10.4230/LIPIcs.MFCS.2019.16.
  23. Emanuel Kieronski. A uniform one-dimensional fragment with alternation of quantifiers. In Fourteenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2023, volume 390 of EPTCS, pages 1–15, 2023. doi:10.4204/EPTCS.390.1.
  24. Complexity and expressivity of uniform one-dimensional fragment with equality. In Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings, Part I, volume 8634 of Lecture Notes in Computer Science, pages 365–376, 2014. doi:10.1007/978-3-662-44522-8\_31.
  25. Uniform one-dimensional fragments with one equivalence relation. In 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, volume 41 of LIPIcs, pages 597–615, 2015. doi:10.4230/LIPICS.CSL.2015.597.
  26. Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership. Log. Methods Comput. Sci., 16(3), 2020. doi:10.23638/LMCS-16(3:16)2020.
  27. Two-variable first-order logic with equivalence closure. SIAM J. Comput., 43(3):1012–1063, 2014. doi:10.1137/120900095.
  28. Entscheidungsproblem reduced to the ∀∃∀for-allfor-all\forall\exists\forall∀ ∃ ∀ case. Proc. Nat. Acad. Sci. U.S.A., 48:365–377, 1962.
  29. Small substructures and decidability issues for first-order logic with two variables. Journal of Symbolic Logic, 77:729–765, 2012. doi:10.2178/JSL/1344862160.
  30. Finite model theory of the triguarded fragment and related logics. In 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, pages 1–13, 2021. doi:10.1109/LICS52264.2021.9470734.
  31. Antti Kuusisto. On the uniform one-dimensional fragment. In 29th International Workshop on Description Logics, Cape Town, South Africa, April 22-25, 2016., 2016.
  32. Harry R. Lewis. Complexity results for classes of quantificational formulas. Journal of Computer and System Sciences, 21(3):317 – 353, 1980. doi:10.1016/0022-0000(80)90027-6.
  33. Sergei J. Maslov. The inverse method for establishing deducibility for logical calculi. The Calculi of Symbolic Logic I: Proceedings of the Steklov Institute of Mathematics, 98, 1971.
  34. Michael Mortimer. On languages with two variables. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 21:135–140, 1975.
  35. Binding forms in first-order logic. In 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, volume 41 of LIPIcs, pages 648–665, 2015. doi:10.4230/LIPICS.CSL.2015.648.
  36. Ian Pratt-Hartmann. The two-variable fragment with counting revisited. In Logic, Language, Information and Computation, 17th International Workshop, WoLLIC 2010, pages 42–54, 2010. doi:10.1007/978-3-642-13824-9\_4.
  37. Ian Pratt-Hartmann. The two-variable fragment with counting and equivalence. Math. Log. Q., 61(6):474–515, 2015. doi:10.1002/malq.201400102.
  38. Ian Pratt-Hartmann. Fluted logic with counting. In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, volume 198 of LIPIcs, pages 141:1–141:17, 2021. doi:10.4230/LIPIcs.ICALP.2021.141.
  39. Complexity of two-variable logic with counting. In 12th Annual IEEE Symposium on Logic in Computer Science, LICS 1997, pages 318–327. IEEE, 1997. doi:10.1109/LICS.1997.614958.
  40. The fluted fragment revisited. J. Symb. Log., 84(3):1020–1048, 2019. doi:10.1017/JSL.2019.33.
  41. Willard V. Quine. On the limits of decision. In Proceedings of the 14th International Congress of Philosophy, volume III, pages 57–62, 1969.
  42. The triguarded fragment of first-order logic. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR-22, volume 57 of EPiC Series in Computing, pages 604–619, 2018. doi:10.29007/M8TS.
  43. Dana Scott. A decision method for validity of sentences in two variables. Journal Symbolic Logic, 27:477, 1962.
  44. Balder ten Cate and Luc Segoufin. Unary negation. Logical Methods in Comp. Sc., 9(3), 2013. doi:10.2168/LMCS-9(3:25)2013.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now