Skip to main content Accessibility help
×
Home

On the expressiveness of frame satisfiability and fragments of second-order logic

  • Thomas Eiter (a1) and Georg Gottlob (a2)

Abstract

It was conjectured by Halpern and Kapron (Annals of Pure and Applied Logic, vol. 69, 1994) that frame satisfiability of propositional modal formulas is incomparable in expressive power to both (Ackermann) and (Bernays-Schönfinkel). We prove this conjecture. Our results imply that (Ackermann) and (Bernays-Schönfinkel) are incomparable in expressive power, already on finite graphs. Moreover, we show that on ordered finite graphs, i.e., finite graphs with a successor, (Bernays-Schönfinkel) is strictly more expressive than (Ackermann).

Copyright

References

Hide All
[1]van Benthem, J., Modal logic and classical logic, Bibliopolis, Naples, 1983.
[2]Büchi, J., Weak second-order logic and finite automata, Z. Math. Logik Grundlagen Math., vol. 5 (1960), pp. 6692.
[3]Chang, C. C. and Keisler, H. J., Model theory, 2nd ed., North-Holland, 1973.
[4]Eiter, T., Gottlob, G., and Gurevich, Y., Normal forms for second-order logic over finite structures, and classification of NP optimization problems, Annals of Pure and Applied Logic, vol. 78 (1996), pp. 111125.
[5]Fagin, R., Generalized first-order spectra and polynomial-time recognizable sets, Complexity of computation (Karp, R. M., editor), American Mathematical Society, 1974, pp. 4374.
[6]Fagin, R., Probabilities on finite models, this Journal, vol. 41 (1976), pp. 5058.
[7]Glebskii, Y., Kogan, D., Liogon'kii, M., and Talanov, V., Range and degree of realizibility of formulas in the restricted predicate calculus, Kibernetika (1969), pp. 1728.
[8]Halpern, J. and Kapron, B., Zero-one laws for modal logic, Annals of Pure and Applied Logic, vol. 69 (1994), pp. 57193.
[9]Kolaitis, P. and Vardi, M. Y., 0-1 laws and decision problems for fragments of second-order logic, Information and Computation, vol. 87 (1990), pp. 302338.
[10]Leivant, D., Descriptive characterizations of computational complexity, Journal of Computer and System Sciences, vol. 39 (1989), pp. 5183.

Related content

Powered by UNSILO

On the expressiveness of frame satisfiability and fragments of second-order logic

  • Thomas Eiter (a1) and Georg Gottlob (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.