A directed graph of finite ^0_-dimension

MaRDI QIDQ2885218zbMATH OpenFDO

Authors D. A. Tusupov

Publication date 21 May 2012

Published in Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)

zbMATH Keywords

computable relationrecursive functionTuring degree

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28) Theory of numerations, effectively presented structures (03D45) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Isomorphisms and definable relations on rings and lattices
• scientific article; zbMATH DE number 5066582
• Degree spectra of relations on structures of finite computable dimension
• Intrinsic bounds on complexity and definability at limit levels
• Degree spectra and computable dimensions in algebraic structures

Cited in

(6)

• A.D. Taimanov and model theory in Kazakhstan
• Intrinsic bounds on complexity and definability at limit levels
• Isomorphisms and definable relations on rings and lattices
• Computable Categoricity of Graphs with Finite Components
• Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension
• Categoricity and complexity of relations over algebraic structures

This page was built for publication: A directed graph of finite \(\Delta^0_{\alpha}\)-dimension

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