当前位置: X-MOL 学术Algebra Logic › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Constructing Decidable Graphs from Decidable Structures
Algebra and Logic ( IF 0.4 ) Pub Date : 2019-11-01 , DOI: 10.1007/s10469-019-09558-8
N. A. Bazhenov , M. Harrison-Trainor

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.

中文翻译:

从可判定结构构建可判定图

结果表明,每一种结构(包括无限语言中的一种)都可以转换成一个图,该图可以与原始结构进行双向解释,对于该图可以从另一个计算出完整的基本图。
更新日期:2019-11-01
down
wechat
bug