Email this article Constructing Decidable Graphs from Decidable Structures
- Authors: Bazhenov N.A.1,2, Harrison-Trainor M.3
-
Affiliations:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- Department of Pure Mathematics, University of Waterloo
- Issue: Vol 58, No 5 (2019)
- Pages: 369-382
- Section: Article
- URL: https://journal-vniispk.ru/0002-5232/article/view/234153
- DOI: https://doi.org/10.1007/s10469-019-09558-8
- ID: 234153
Cite item
Open Access
Access granted
Subscription Access
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.
About the authors
N. A. Bazhenov
Sobolev Institute of Mathematics; Novosibirsk State University
Author for correspondence.
Email: bazhenov@math.nsc.ru
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 1, Novosibirsk, 630090
M. Harrison-Trainor
Department of Pure Mathematics, University of Waterloo
Email: bazhenov@math.nsc.ru
Canada, Waterloo, ON, N2L 3G1
Supplementary files
