Skip to main content
Log in

Satisfiability of bright formulas

  • Brief Communications
  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

We investigate one solvable subclass of quantified formulas in pure predicate calculus and obtain a necessary and sufficient condition for the satisfiability of formulas from this subclass.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. E. Börger, E. Gradel, and Yu. Gurevich, The Classical Decision Problem, Springer, Berlin (1997).

    MATH  Google Scholar 

  2. A. S. Denisov, “The satisfiability in the class of composite formulas,” in: Abstracts of the Logic Colloquium’95, Haifa, Israel (1995), p. 64.

  3. A. I. Mal’tsev, “Investigations in the field of mathematical logic,” in: A. I. Mal’tsev, Selected Works, Vol. 2, Mathematical Logic and General Theory of Algebraic Systems [in Russian], Nauka, Moscow (1976), pp. 5–16.

    Google Scholar 

  4. A. S. Denisov, “Satisfiability of alternative formulas,” Mat. Zametki Yakut. Univ., Issue 1, 38–41 (1996).

Download references

Author information

Authors and Affiliations

Authors

Additional information

__________

Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 59, No. 10, pp. 1432–1435, October, 2007.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Denisov, A.S. Satisfiability of bright formulas. Ukr Math J 59, 1606–1610 (2007). https://doi.org/10.1007/s11253-008-0004-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11253-008-0004-0

Keywords

Navigation