Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.]:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics], 2024, Issue 2, Pages 27–38
DOI: https://doi.org/10.26456/vtpmk708
(Mi vtpmk708)
 

Mathematical Logic, Algebra, Number Theory and Discrete Mathematics

On finite subsets monoid with decidable theory

S. M. Dudakovab

a Tver State University, Tver
b National Research University Higher School of Economics, Moscow
References:
Abstract: In our previous works, we have proved for various associative algebras that the finite subsets theory allows to interpret elementary arithmetic, in particular, such theory is undecidable. For example, this is proved for all infinite Abelian groups. A natural question arises: can we generalize this result to a wider class of algebras, for example, all commutative monoids. In some cases, we also have proved analogous result: for commutative cancellative monoids with an element of infinite order, or arbitrary Abelian groups. In this paper we prove that this is not true for arbitrary commutative monoids. Moreover, we propose a method that allows to construct such algebras by various original algebras. Also, we have found a limitation of this method.
Keywords: subset algebra, algorithmic decidability, automatic structure.
Received: 25.04.2024
Revised: 17.07.2024
Bibliographic databases:
Document Type: Article
UDC: 510.65
Language: Russian
Citation: S. M. Dudakov, “On finite subsets monoid with decidable theory”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2024, no. 2, 27–38
Citation in format AMSBIB
\Bibitem{Dud24}
\by S.~M.~Dudakov
\paper On finite subsets monoid with decidable theory
\jour Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.]
\yr 2024
\issue 2
\pages 27--38
\mathnet{http://mi.mathnet.ru/vtpmk708}
\crossref{https://doi.org/10.26456/vtpmk708}
\elib{https://elibrary.ru/item.asp?id=72342880}
Linking options:
  • https://www.mathnet.ru/eng/vtpmk708
  • https://www.mathnet.ru/eng/vtpmk/y2024/i2/p27
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics]
    Statistics & downloads:
    Abstract page:56
    Full-text PDF :4
    References:13
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024