Constructing Decidable Graphs from Decidable Structures

N. A. Bazhenov, M. Harrison-Trainor

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)369-382
Number of pages14
JournalAlgebra and Logic
Volume58
Issue number5
DOIs
Publication statusPublished - 1 Nov 2019

Keywords

  • bi-interpretable structures
  • decidable graph
  • decidable structure
  • full diagram
  • DEGREE SPECTRA

State classification of scientific and technological information

  • 27 MATHEMATICS

Fingerprint Dive into the research topics of 'Constructing Decidable Graphs from Decidable Structures'. Together they form a unique fingerprint.

Cite this