Computable Categoricity of Graphs with Finite Components

DOI10.1007/978-3-540-69407-6_15MaRDI QIDQ3507427zbMATH OpenOpenAlexFDO

Authors Bakhadyr Khoussainov, Jiamou Liu, Barbara Csima

Publication date 19 June 2008

Published in Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10292/2811

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Recommendations

• Computable categoricity of trees of finite height
• Computable categoricity and the Ershov hierarchy
• A directed graph of finite \(\Delta^0_{\alpha}\)-dimension
• scientific article; zbMATH DE number 4105024
• Computability-theoretic categoricity and Scott families

Cited in

(11)

• Graphs are not universal for online computability
• Graphs and models with finite chains
• Computable dimension for ordered fields
• CATEGORIFICATION VIA EQUIPPED GRAPHS
• Computable categoricity of trees of finite height
• scientific article; zbMATH DE number 4105024 (Why is no real title available?)
• Computable isomorphisms for certain classes of infinite graphs
• The complexity of computable categoricity
• Computing planarity in computable planar graphs
• Cohesive powers of structures
• On categoricity spectra for locally finite graphs

This page was built for publication: Computable Categoricity of Graphs with Finite Components

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