Algebra i logika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Algebra Logika:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Algebra i logika, 2019, Volume 58, Number 5, Pages 553–573
DOI: https://doi.org/10.33048/alglog.2019.58.501 (Mi al916) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Constructing decidable graphs from decidable structures

N. A. Bazhenovab, M. Harrison-Trainorc

a Novosibirsk State University
b Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
c Dep. Pure Math., Univ. Waterloo, ON, CANADA N2L 3G1
Full-text PDF (685 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.33048/alglog.2019.58.501
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: decidable structure, decidable graph, bi-interpretable structures, full diagram.
Funding agency Grant number
Siberian Branch of Russian Academy of Sciences I.1.1, проект № 0314-2019-0002
Natural Sciences and Engineering Research Council of Canada (NSERC)
Supported by SB RAS Fundamental Research Program I.1.1, project No. 0314-2019-0002. Supported by an NSERC Banting fellowship.
Received: 29.11.2017
Revised: 26.11.2019
English version:
Algebra and Logic, 2019, Volume 58, Issue 5, Pages 369–382
DOI: https://doi.org/10.1007/s10469-019-09558-8
Bibliographic databases:
Document Type: Article
UDC: 510.54
Language: Russian
Citation: N. A. Bazhenov, M. Harrison-Trainor, “Constructing decidable graphs from decidable structures”, Algebra Logika, 58:5 (2019), 553–573; Algebra and Logic, 58:5 (2019), 369–382
Citation in format AMSBIB
\Bibitem{BazHar19}
\by N.~A.~Bazhenov, M.~Harrison-Trainor
\paper Constructing decidable graphs from decidable structures
\jour Algebra Logika
\yr 2019
\vol 58
\issue 5
\pages 553--573
\mathnet{http://mi.mathnet.ru/al916}
\crossref{https://doi.org/10.33048/alglog.2019.58.501}
\transl
\jour Algebra and Logic
\yr 2019
\vol 58
\issue 5
\pages 369--382
\crossref{https://doi.org/10.1007/s10469-019-09558-8}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000500353600001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85076014888}
Linking options:
  • https://www.mathnet.ru/eng/al916
  • https://www.mathnet.ru/eng/al/v58/i5/p553
    • This publication is cited in the following 2 articles:
    1. Renaud Fabre, Patrice Bellot, Daniel Egret, “Challenging Scientific Categorizations Through Dispute Learning”, Applied Sciences, 15:4 (2025), 2241  crossref
    2. N. Bazhenov, M. Marchuk, “A note on decidable categoricity and index sets”, Sib. elektron. matem. izv., 17 (2020), 1013–1026  mathnet  crossref
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Алгебра и логика Algebra and Logic
    Statistics & downloads:
    Abstract page:262
    Full-text PDF :27
    References:41
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025