Skip to main content
SpringerLink
Log in

Undecidability of a simple fragment of a positive theory with a single constant for a free semigroup of rank two

  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

In the paper we study the algorithmic nature of some “simple” fragments of positive theories with “few” constants for free noncyclic semigroups.

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

Similar content being viewed by others

References

  1. W. Quine, “Concatenation as a basis for arithmetic,”J. Symbolic Logic,11, 105–114 (1946).

    Article  MATH  MathSciNet  Google Scholar 

  2. V. G. Durnev, “On a positive theory of a free semigroup,” in:Problems of the Theory of Groups and Semigroups [in Russian], Tula (1972), pp. 122–172.

  3. N. K. Kosovskii,Elements of Mathematical Logic and Its Applications to the Theory of Subrecursive Algorithms [in Russian], Izd. LGU, Leningrad (1981).

    Google Scholar 

  4. G. S. Makanin, “The problem of the solvability of equations in a free semigroup,”Mat. Sb. [Math. USSR-Sb.],103 (145), No. 2 (6), 147–236 (1977).

    MathSciNet  Google Scholar 

  5. V. G. Durnev, A positive theory of a free semigroup,Dokl. Akad. Nauk SSSR [Soviet Math. Dokl.],211, No. 4, 772–774 (1973).

    MathSciNet  Google Scholar 

  6. S. S. Marchenkov, “Undecidability of the positive ∀∃-theory of a free semigroup,”Sibirsk. Mat. Zh. [Siberian Math. J.],23, No. 1, 196–198 (1982).

    MATH  MathSciNet  Google Scholar 

  7. V. G. Durnev, “The undecidability of the positive ∀∃3-theory of a free semigroup,”Sibirsk. Mat. Zh. [Siberian Math. J.],36, No. 5, 1067–1080 (1995).

    MathSciNet  Google Scholar 

  8. N. A. Peryazev, “On the positive equivalence of free algebras,” in:Eighth All-Union Conference in Mathematical Logic [in Russian], Abstracts of Papers, Moscow (1986), p. 149.

  9. A. I. Mal’tsev,Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. P. G. Demidov Yaroslavl State University, USSR

    V. G. Durnev

Authors
  1. V. G. Durnev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated fromMatematicheskie Zametki, Vol. 67, No. 2, pp. 191–200, February, 2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Durnev, V.G. Undecidability of a simple fragment of a positive theory with a single constant for a free semigroup of rank two. Math Notes 67, 152–159 (2000). https://doi.org/10.1007/BF02686241

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation