On Computability Theoretic Properties of Structures and Their Cartesian Products

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200010)46:4<467::AID-MALQ467>3.0.CO;2-V" /><467::AID-MALQ467>3.0.CO;2-V 10.1002/1521-3870(200010)46:4<467::AID-MALQ467>3.0.CO;2-VzbMath0964.03046OpenAlexW2003044426MaRDI QIDQ4521122

Bakhadyr Khoussainov

Publication date: 16 July 2001

Full work available at URL: https://doi.org/10.1002/1521-3870(200010)46:4<467::aid-malq467>3.0.co;2-v

zbMATH Keywords

computable structurecomputable setcomputable isomorphism typescomputable presentations

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

This page was built for publication: On Computability Theoretic Properties of Structures and Their Cartesian Products