Computable isomorphisms for certain classes of infinite graphs

DOI10.1142/S0218216518410122MaRDI QIDQ4579860zbMATH OpenWikidataFDO

Authors Hakim J. Walker

Publication date 10 August 2018

Published in Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1701.01227

zbMATH Keywords

treegraph isomorphismcomputabilitycomputable categoricity

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• Two-to-one structures
• Computability-theoretic properties of injection structures
• Computable transformations of structures
• Computable Categoricity of Graphs with Finite Components
• Computability and categoricity of ultrahomogeneous structures

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• Autostability of models
• Computability-theoretic properties of injection structures
• Computable Categoricity of Graphs with Finite Components
• Computable categoricity of trees of finite height
• Computable structures and the hyperarithmetical hierarchy
• Effective categoricity of equivalence structures
• Recursive isomorphism types of recursive Boolean algebras
• Recursively Categorical Linear Orderings
• The computable dimension of ordered abelian groups
• The computable dimension of trees of infinite height
• Two-to-one structures

Cited in

(5)

• Computability-theoretic properties of injection structures
• Graphs are not universal for online computability
• scientific article; zbMATH DE number 89183 (Why is no real title available?)
• Computable Isomorphisms for Certain Classes of Infinite Graphs
• Two-to-one structures

This page was built for publication: Computable isomorphisms for certain classes of infinite graphs

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