N. A. Bazhenov, M. Harrison-Trainor, “Constructing decidable graphs from decidable structures”, Algebra Logika, 2019, Volume 58, Number 5,Pages <nobr>553

This article is cited in 1 paper

Constructing decidable graphs from decidable structures

N. A. Bazhenov^ab, M. Harrison-Trainor^c

^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.

UDC: 510.54

Received: 29.11.2017
Revised: 26.11.2019

DOI: 10.33048/alglog.2019.58.501