Построение разрешимых графов по разрешимым структурам

Translated title of the contribution: Constructing decidable graphs from decidable structures

Research output: Contribution to journalArticlepeer-review

Abstract

It is shown that every structure (including one in an infinite language) can be transformed into a graph that is bi-interpretable with the original structure, for which the full elementary diagrams can be computed one from the other
Translated title of the contributionConstructing decidable graphs from decidable structures
Original languageRussian
Pages (from-to)553-573
Number of pages21
JournalАлгебра и логика
Volume58
Issue number5
Publication statusPublished - 2019

OECD FOS+WOS

  • 1.01 MATHEMATICS

State classification of scientific and technological information

  • 27 MATHEMATICS

Fingerprint Dive into the research topics of 'Constructing decidable graphs from decidable structures'. Together they form a unique fingerprint.

Cite this