Skip to main content
SpringerLink
Log in

Reduction class\(\forall x\forall y\exists zF{\text{ (}}x{\text{,}}y,z) \wedge \forall ^m \mathfrak{A}(F)\)

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. V. F. Kostyrko, “The decidability problem for a case of Ackerman,” Sibirsk. Mate. Zh.,6, No. 2 (1965).

  2. J. S. Denton, “A reduction class with a single binary predicate,” Not. Amer. Math. Soc.,10 (1963).

  3. V. F. Kostyrko, The Decidability Problem in the Restricted Predicate Calculus [in Russian], Candidate's Dissertation, Kiev (1965).

  4. Yu. Sh. Gurevich, “Effective recognition of the satisfiability of formulas in the restricted predicate calculus,” Algebra i Logika,5, No. 2 (1966).

  5. D. Klaua, “Systematische Behandlung der Lösbaren Fälle des Entscheidungsproblem,” Z. Math. Logik und Grundl. Math.,1 (1955).

  6. V. F. Kostyrko, Undecidability of the elementary ∃-theory of groupoids,” in: Engineering Cybernetics [in Russian], Izd. IK Akad. Nauk Ukr. SSR, Kiev (1971).

    Google Scholar 

Download references

Authors
  1. V. F. Kostyrko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Institute of Cybernetics, Academy of Sciences of the Ukrainian SSR, Kiev. Translated from Kibernetika, No. 5, pp. 1–3, September–October, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kostyrko, V.F. Reduction class\(\forall x\forall y\exists zF{\text{ (}}x{\text{,}}y,z) \wedge \forall ^m \mathfrak{A}(F)\) . Cybern Syst Anal 7, 753–755 (1971). https://doi.org/10.1007/BF01641489

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation