Enviar artigo por via de e-mail Constructing Decidable Graphs from Decidable Structures
- Autores: Bazhenov N.A.1,2, Harrison-Trainor M.3
-
Afiliações:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- Department of Pure Mathematics, University of Waterloo
- Edição: Volume 58, Nº 5 (2019)
- Páginas: 369-382
- Seção: Article
- URL: https://journals.rcsi.science/0002-5232/article/view/234153
- DOI: https://doi.org/10.1007/s10469-019-09558-8
- ID: 234153
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Palavras-chave
Sobre autores
N. Bazhenov
Sobolev Institute of Mathematics; Novosibirsk State University
Autor responsável pela correspondência
Email: bazhenov@math.nsc.ru
Rússia, 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
Canadá, Waterloo, ON, N2L 3G1
Arquivos suplementares
