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], 2014, Issue 4, Pages 17–32 (Mi vtpmk99)  

Theoretical Foundations of Computer Science

On undecidability of logic of quasiary predicates

M. N. Rybakov

Tver State University
Abstract: A translation from the first-order language to the language of the logic of quasiary predicates is constructed. The translation preserves satisfiability of formulas in classes of models defined on the same sets of elements. As a corollary we obtain that the logic of quasiary predicates is undecidable, the finite model theory of quasiary predicates is not recursively enumerable, etc.
Keywords: logic of quasiary predicates, undecidability, recursive enumerability.
Received: 22.11.2014
Document Type: Article
UDC: 510
Language: Russian
Linking options:
  • https://www.mathnet.ru/eng/vtpmk99
  • 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:28
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025