Standard

Constructing Decidable Graphs from Decidable Structures. / Bazhenov, N. A.; Harrison-Trainor, M.

In: Algebra and Logic, Vol. 58, No. 5, 01.11.2019, p. 369-382.

Research output: Contribution to journal › Article › peer-review

Harvard

Bazhenov, NA & Harrison-Trainor, M 2019, 'Constructing Decidable Graphs from Decidable Structures', Algebra and Logic, vol. 58, no. 5, pp. 369-382. https://doi.org/10.1007/s10469-019-09558-8

APA

Bazhenov, N. A., & Harrison-Trainor, M. (2019). Constructing Decidable Graphs from Decidable Structures. Algebra and Logic, 58(5), 369-382. https://doi.org/10.1007/s10469-019-09558-8

Vancouver

Bazhenov NA, Harrison-Trainor M. Constructing Decidable Graphs from Decidable Structures. Algebra and Logic. 2019 Nov 1;58(5):369-382. doi: 10.1007/s10469-019-09558-8

Author

Bazhenov, N. A. ; Harrison-Trainor, M. / Constructing Decidable Graphs from Decidable Structures. In: Algebra and Logic. 2019 ; Vol. 58, No. 5. pp. 369-382.

BibTeX

@article{ce44859625564685858f992d9f00aef1,
title = "Constructing Decidable Graphs from Decidable Structures",
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 = "bi-interpretable structures, decidable graph, decidable structure, full diagram, DEGREE SPECTRA",
author = "Bazhenov, {N. A.} and M. Harrison-Trainor",
year = "2019",
month = nov,
day = "1",
doi = "10.1007/s10469-019-09558-8",
language = "English",
volume = "58",
pages = "369--382",
journal = "Algebra and Logic",
issn = "0002-5232",
publisher = "Springer US",
number = "5",

}

RIS

TY - JOUR

T1 - Constructing Decidable Graphs from Decidable Structures

AU - Bazhenov, N. A.

AU - Harrison-Trainor, M.

PY - 2019/11/1

Y1 - 2019/11/1

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

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

KW - bi-interpretable structures

KW - decidable graph

KW - decidable structure

KW - full diagram

KW - DEGREE SPECTRA

UR - http://www.scopus.com/inward/record.url?scp=85076014888&partnerID=8YFLogxK

U2 - 10.1007/s10469-019-09558-8

DO - 10.1007/s10469-019-09558-8

M3 - Article

AN - SCOPUS:85076014888

VL - 58

SP - 369

EP - 382

JO - Algebra and Logic

JF - Algebra and Logic

SN - 0002-5232

IS - 5

ER -

ID: 22574795