电邮这篇文章 Constructing Decidable Graphs from Decidable Structures
- 作者: Bazhenov N.A.1,2, Harrison-Trainor M.3
-
隶属关系:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- Department of Pure Mathematics, University of Waterloo
- 期: 卷 58, 编号 5 (2019)
- 页面: 369-382
- 栏目: Article
- URL: https://journal-vniispk.ru/0002-5232/article/view/234153
- DOI: https://doi.org/10.1007/s10469-019-09558-8
- ID: 234153
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
N. Bazhenov
Sobolev Institute of Mathematics; Novosibirsk State University
编辑信件的主要联系方式.
Email: bazhenov@math.nsc.ru
俄罗斯联邦, 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
加拿大, Waterloo, ON, N2L 3G1
补充文件
