Constructing decidable graphs from decidable structures

DOI10.1007/S10469-019-09558-8zbMATH Open1480.03022OpenAlexW2994392302MaRDI QIDQ2300933FDOQ2300933

Authors: Matthew Harrison-Trainor, Nikolay Bazhenov 

Publication date: 28 February 2020

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-019-09558-8

Recommendations

• Nonmaximal decidable structures
• scientific article; zbMATH DE number 18951
• Automatic Structures of Bounded Degree Revisited
• When Is Reachability Intrinsically Decidable?
• Transforming structures by set interpretations

zbMATH Keywords

decidable structurebi-interpretable structuresdecidable graphfull diagram

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Title not available (Why is that?)
• Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations
• Title not available (Why is that?)
• Problem of the number of non-self-equivalent constructivizations
• Title not available (Why is that?)
• Degree spectra and computable dimensions in algebraic structures
• A computable functor from graphs to fields
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• A fixed point for the jump operator on structures
• The quantity of nonautoequivalent constructivizations
• Autostability and computable families of constructivizations
• An autostable 1-decidable model without a computable Scott family of \(\exists\)-formulas
• Spectra of theories and structures
• Computability theoretic classifications for classes of structures
• There is no classification of the decidably presentable structures
• Degree spectra of structures relative to equivalences
• Computable trees, prime models, and relative decidability
• A computable ℵ₀-categorical structure whose theory computes true arithmetic
• Theory spectra and classes of theories

Cited In (5)

• Title not available (Why is that?)
• Nonmaximal decidable structures
• Title not available (Why is that?)
• A note on decidable categoricity and index sets
• Decidability of string graphs

This page was built for publication: Constructing decidable graphs from decidable structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300933)