Skip to main content
Log in

The decision problem for the logic of predicates and of operations

  • Published:
Algebra and Logic Aims and scope

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.

Literature cited

  1. W. Ackermann, Solvable Cases of the Decision Problem, Amsterdam (1954).

  2. Yu. Sh. Gurevich, “On effective recognition of well formedness of formulas in ‘UIP’,” Algebra i Logika,5, No. 2, 25–55 (1966).

    MATH  MathSciNet  Google Scholar 

  3. Yu. Sh. Gurevich, “Formulas with one ∀ ,” in: “In Memory of A. I. Mal'tsev” (in press).

  4. V. A. Livshits, “Some classes of reduction and undecidable theories,” Notes of the Science Seminars of the Mathematics Department of the Steklov Mathematical Institute, Leningrad,4 (1967).

  5. M. H. Loeb, “Decidability of the monadic predicate calculus with unary function symbols,” J. Symbolic Logic,32, No. 4, 563 (1967).

    Google Scholar 

  6. A. G. Kurosh, Lectures in General Algebra [in Russian], Moscow (1962).

  7. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Moscow (1965).

  8. S. Yu. Maslov, “Inverse method of establishing dedicability for nonprenex forms in predicate calculus,” Dokl. Akad. Nauk,172, No. 1, 22–25 (1967).

    MATH  Google Scholar 

  9. A. Church, Introduction to Mathematical Logic, Princeton (1956).

Download references

Authors

Additional information

Translated from Algebra i Logika, Vol. 8, No. 3, pp. 284–308, May–June, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gurevich, Y.S. The decision problem for the logic of predicates and of operations. Algebr Logic 8, 160–174 (1969). https://doi.org/10.1007/BF02306690

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02306690

Keywords

Navigation