Skip to main content
SpringerLink
Log in

On Undecidability of Subset Theories of Some Unars

  • MATHEMATICS
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

Abstract

This paper is dedicated to studying the algorithmic properties of unars with an injective function. We prove that the theory of every such unar admits quantifier elimination if the language is extended by a countable set of predicate symbols. Necessary and sufficient conditions are established for the quantifier elimination to be effective, and a criterion for decidability of theories of such unars is formulated. Using this criterion, we build a unar such that its theory is decidable, but the theory of the unar of its subsets is undecidable.

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. A. Mostowski, “On direct products of theories,” J. Symb. Logic 17 (3), 1–31 (1952). https://doi.org/10.1016/S0049-237X(09)70257-5

    Article  MathSciNet  Google Scholar 

  2. C. Marini, G. Simi, A. Sorbi, and M. Sorrentino, “A note on algebras of languages,” Theor. Comput. Sci. 412, 6531–6536 (2011). https://doi.org/10.1016/j.tcs.2011.08.022

    Article  MathSciNet  Google Scholar 

  3. A. S. Konovalov and V. L. Selivanov, “Boolean algebras of regular languages,” Algebra Logika 52 (6), 676–711 (2013).

    MathSciNet  Google Scholar 

  4. S. M. Dudakov, “On undecidability of concatenation theory for one-symbol languages,” Lobachevskii J. Math. 41 (2), 168–175 (2020). https://doi.org/10.1134/S1995080220020055

    Article  MathSciNet  Google Scholar 

  5. S. Dudakov and B. Karlov, “On decidability of theories of regular languages,” Theory Comput. Syst. 65 (3), 462–478 (2021). https://doi.org/10.1007/s00224-020-09995-4

    Article  MathSciNet  Google Scholar 

  6. A. Ehrenfeucht, “Decidability of the theory of one function,” Notic. Am. Math. Soc. 6, 268 (1959).

    Google Scholar 

  7. A. A. Ivanov, “Complete theories of unars,” Algebra Logika 23 (1), 48–73 (1984).

    Article  MathSciNet  Google Scholar 

  8. A. A. Ivanov, “On complete theories of unars,” Sib. Mat. Zh. 27 (1), 57–69 (1986).

    Article  MathSciNet  Google Scholar 

  9. B. N. Karlov, “On elementary equivalence of some unoids and unoids of their subsets,” Vestn. Tver. Gos. Univ. Ser. Prikl. Mat. 3, 18–32 (2021). https://doi.org/10.26456/vtpmk620

    Article  Google Scholar 

  10. S. M. Dudakov. “On algorithmic properties of finite subset algebra for some unoids,” Vestn. Tver. Gos. Univ. Ser. Prikl. Mat. 4, 108–116 (2019). https://doi.org/10.26456/vtpmk550

    Article  Google Scholar 

  11. B. N. Karlov, “On some properties of unoids of subsets,” in Proceedings of Applied Mathematics, Computational Science, and Mechanics: Current Problems, Voronezh, December 13–15, 2021 (Wellborn, Voronezh, 2022), pp. 1594–1600.

  12. J. D. Monk, Mathematical Logic (Springer, New York, 1976). https://doi.org/10.1007/978-1-4684-9452-5

    Book  Google Scholar 

Download references

Funding

This work was supported by ongoing institutional funding. No additional grants to carry out or direct this particular research were obtained.

Author information

Authors and Affiliations

  1. Tver State University, Tver, Russia

    B. N. Karlov

Authors
  1. B. N. Karlov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. N. Karlov.

Ethics declarations

The author of this work declares that he has no conflicts of interest.

Additional information

Translated by I. Ruzanova

Publisher’s Note.

Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Karlov, B.N. On Undecidability of Subset Theories of Some Unars. Dokl. Math. (2024). https://doi.org/10.1134/S1064562424701874

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1134/S1064562424701874

Keywords:

Search

Navigation