Computable isomorphisms for certain classes of infinite graphs

DOI10.1142/S0218216518410122WikidataQ129840774 ScholiaQ129840774MaRDI QIDQ4579860FDOQ4579860

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

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

zbMATH Keywords

treegraph isomorphismcomputabilitycomputable categoricity

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

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

Cited In (5)

• Computability-theoretic properties of injection structures
• Graphs are not universal for online computability
• Title not available (Why is that?)
• Two-to-one structures
• Computable Isomorphisms for Certain Classes of Infinite Graphs

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)