|
This article is cited in 1 scientific paper (total in 1 paper)
Constructing decidable graphs from decidable structures
N. A. Bazhenovab, M. Harrison-Trainorc a Novosibirsk State University
b Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
c Dep. Pure Math., Univ. Waterloo, ON, CANADA N2L 3G1
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.
Keywords:
decidable structure, decidable graph, bi-interpretable structures,
full diagram.
Received: 29.11.2017 Revised: 26.11.2019
Citation:
N. A. Bazhenov, M. Harrison-Trainor, “Constructing decidable graphs from decidable structures”, Algebra Logika, 58:5 (2019), 553–573; Algebra and Logic, 58:5 (2019), 369–382
Linking options:
https://www.mathnet.ru/eng/al916 https://www.mathnet.ru/eng/al/v58/i5/p553
|
Statistics & downloads: |
Abstract page: | 202 | Full-text PDF : | 6 | References: | 19 | First page: | 5 |
|