previous :: next
Small substructures and decidability issues for first-order logic with two variables
Emanuel Kieroński and Martin Otto
Source: J. Symbolic Logic Volume 77, Issue 3
(2012), 729-765.
Abstract
We study first-order logic with two variables FO2 and establish a small substructure property. Similar to the small model property for FO2 we obtain an exponential size bound on embedded substructures, relative to a fixed surrounding structure that may be infinite. We apply this technique to analyse the satisfiability problem for FO2 under constraints that require several binary relations to be interpreted as equivalence relations. With a single equivalence relation, FO2 has the finite model property and is complete for non-deterministic exponential time, just as for plain FO2. With two equivalence relations, FO2 does not have the finite model property, but is shown to be decidable via a construction of regular models that admit finite descriptions even though they may necessarily be infinite. For three or more equivalence relations, FO2 is undecidable.
First Page:
Show
Hide
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jsl/1344862160
Zentralblatt MATH identifier: 06083951
Digital Object Identifier: doi:10.2178/jsl/1344862160
Mathematical Reviews number (MathSciNet): MR2987136
References
H. Andréka, I. Németi, and J. van Benthem Modal languages and bounded fragments of predicate logic, Journal of Philosophical Logic, vol. 27(1998), no. 3, pp. 217–274.
Mathematical Reviews (MathSciNet): MR1624137
Zentralblatt MATH: 0919.03013
Digital Object Identifier: doi:10.1023/A:1004275029985
F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. Patel-Schneider (editors) The description logic handbook, Cambridge University Press, Cambridge,2003.
Mathematical Reviews (MathSciNet): MR1991592
R. Berger The undecidability of the domino problem, Memoirs of the American Mathematical Society, vol. 66(1966), p. 72.
Mathematical Reviews (MathSciNet): MR216954
Zentralblatt MATH: 0199.30802
M. Bojańczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin Two-variable logic on words with data, LICS, Proceedings of the 21st IEEE Symposium on Logic in Computer Science,2006, pp. 7–16.
E. Börger, E. Grädel, and Y. Gurevich The classical decision problem, Perspectives in Mathematical Logic, Springer,1997.
Mathematical Reviews (MathSciNet): MR1482227
A. Borgida On the relative expressiveness of description logics and predicate logics, Artificial Intelligence, vol. 82(1996), pp. 353–367.
Mathematical Reviews (MathSciNet): MR1391067
Digital Object Identifier: doi:10.1016/0004-3702(96)00004-5
C. David, L. Libkin, and T. Tan On the satisfiability of two-variable logic over data words, LPAR, Logic for Programming, Artificial Intelligence, and Reasoning, Lecture Notes in Computer Science, vol. 6397,2010, pp. 248–262.
F. Eisenbrand and G. Shmonin Carathéodory bounds for integer cones, Operations Research Letters, vol. 34(2006), no. 5, pp. 564–568.
Mathematical Reviews (MathSciNet): MR2238405
Digital Object Identifier: doi:10.1016/j.orl.2005.09.008
H. Ganzinger, C. Meyer, and M. Veanes The two-variable guarded fragment with transitive relations, LICS, Proceedings of the 14th Symposium on Logic in Computer Science, IEEE Computer Society, Los Alamitos, CA,1999, pp. 24–34.
Mathematical Reviews (MathSciNet): MR1942517
W. Goldfarb The unsolvability of the Gödel class with identity, Journal of Symbolic Logic, vol. 49(1984), pp. 1237–1252.
Mathematical Reviews (MathSciNet): MR771790
Digital Object Identifier: doi:10.2307/2274274
E. Grädel On the restraining power of guards, Journal of Symbolic Logic, vol. 64(1999), pp. 1719–1742.
Mathematical Reviews (MathSciNet): MR1780081
Zentralblatt MATH: 0958.03027
Digital Object Identifier: doi:10.2307/2586808
E. Grädel, P. Kolaitis, and M. Vardi On the decision problem for two-variable first-order logic, Bulletin of Symbolic Logic, vol. 3(1997), pp. 53–69.
Mathematical Reviews (MathSciNet): MR1444914
Zentralblatt MATH: 0873.03009
Digital Object Identifier: doi:10.2307/421196
E. Grädel and M. Otto On logics with two variables, Theoretical Computer Science, vol. 224(1999), pp. 73–113.
Mathematical Reviews (MathSciNet): MR1714791
Zentralblatt MATH: 0948.03023
Digital Object Identifier: doi:10.1016/S0304-3975(98)00308-9
E. Grädel, M. Otto, and E. Rosen Two-variable logic with counting is decidable, LICS, Proceedings of the 12th IEEE Symposium on Logic in Computer Science,1997, pp. 306–317.
E. Grädel, M. Otto, and E. Rosen Undecidability results on two-variable logics, Archive for Mathematical Logic, vol. 38(1999), pp. 313–354.
Mathematical Reviews (MathSciNet): MR1697963
Zentralblatt MATH: 0927.03015
Digital Object Identifier: doi:10.1007/s001530050130
Y. Gurevich and I. Koryakov Remarks on Berger's paper on the domino problem, Siberian Mathematical Journal, vol. 13(1972), pp. 319–321.
N. Immerman and E. Lander Describing graphs: a first-order approach to graph canonization, Complexity theory retrospective (A. Selman, editor), Springer,1990, pp. 59–81.
Mathematical Reviews (MathSciNet): MR1060782
Digital Object Identifier: doi:10.1007/978-1-4612-4478-3_5
Y. Kazakov Saturation-based decision procedures for extensions of the guarded fragment, Ph.D. thesis, Universität des Saarlandes, Saarbrücken, Germany,2006.
E. Kieroński Results on the guarded fragment with equivalence or transitive relations, CSL, Proceedings of Computer Science Logic, Lecture Notes in Computer Science, vol. 3634, Springer,2005, pp. 309–324.
Mathematical Reviews (MathSciNet): MR2200568
Digital Object Identifier: doi:10.1007/11538363_22
–––– On the complexity of the two-variable guarded fragment with transitive guards, Information and Computation, vol. 204(2006), pp. 1663–1703.
Mathematical Reviews (MathSciNet): MR2269899
Zentralblatt MATH: 1115.03021
Digital Object Identifier: doi:10.1016/j.ic.2006.08.001
E. Kieroński, J. Michaliszyn, I. Pratt-Hartmann, and L. Tendera Two-variable first-order logic with equivalence closure, in preparation.
E. Kieroński and M. Otto Small substructures and decidability issues for first-order logic with two variables, Proceedings of the 20th IEEE Symposium on Logic in Computer Science,LISC 2005, pp. 448–457.
E. Kieroński and L. Tendera On finite satisfiability of the guarded fragment with equivalence or transitive guards, LPAR, Logic for Programming, Artificial Intelligence, and Reasoning, Lecture Notes in Computer Science, vol. 4790,2007, pp. 318–322.
–––– On finite satisfiability of two-variable first order logic with equivalence relations., LICS, Proceedings of the 23rd IEEE Symposium on Logic in Computer Science,2009, pp. 123–132.
Mathematical Reviews (MathSciNet): MR2932376
A. Manuel Two variables and two successors, Proceedings of the 35th International Symposium on Mathematical foundations of Computer Science, Lecture Notes in Computer Science, vol. 6281, Springer,MFCS 2010, pp. 513–524.
Mathematical Reviews (MathSciNet): MR2727254
Zentralblatt MATH: 05779315
Digital Object Identifier: doi:10.1007/978-3-642-15155-2_45
M. Mortimer On languages with two variables, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 21(1975), pp. 135–140.
Mathematical Reviews (MathSciNet): MR396245
M. Niewerth and T. Schwentick Two-variable logic and key constraints on data words, ICDT, Proceedings of the 14th International Conference on Database Theory,2011, pp. 138–149.
M. Otto Two variable first-order logic over ordered domains, Journal of Symbolic Logic, vol. 66(2001), pp. 685–702.
Mathematical Reviews (MathSciNet): MR1833471
Zentralblatt MATH: 0990.03005
Digital Object Identifier: doi:10.2307/2695037
L. Pacholski, W. Szwast, and L. Tendera Complexity of two-variable logic with counting, LICS, Proceedings of the 12th IEEE Symposium on Logic in Computer Science,1997, pp. 318–327.
T. Schwentick and T. Zeume Two-variable logic with two order relations, CSL, Proceedings of Computer Science Logic, Lecture Notes in Computer Science, vol. 6247,2010, pp. 499–513.
D. Scott A decision method for validity of sentences in two variables, Journal of Symbolic Logic, vol. 27(1962), p. 377.
W. Szwast and L. Tendera On the decision problem for the guarded fragment with transitivity, LICS, Proceedings of the 16th IEEE Symposium on Logic in Computer Science,2001, pp. 147–156.
previous :: next
