^0_1-presentations of algebras

DOI10.1007/S00153-006-0013-3zbMATH Open1099.03025OpenAlexW2074185447MaRDI QIDQ2505502FDOQ2505502

Authors: Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin 

Publication date: 26 September 2006

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-006-0013-3

Recommendations

• Independence in computable algebra
• COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
• Complexity of some natural problems on the class of computable \(I\)-algebras
• On Index Sets of Some Properties of Computable Algebras
• \(\Pi_{1}^{0}\) classes and orderable groups

zbMATH Keywords

computable algebras

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Title not available (Why is that?)
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• Hierarchies of Boolean algebras
• Handbook of computability theory
• Title not available (Why is that?)
• COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
• Title not available (Why is that?)
• Stability among r.e. quotient algebras
• Title not available (Why is that?)

Cited In (15)

• Separable enumerations of division rings and effective embeddability of rings therein
• Computable quotient presentations of models of arithmetic and set theory
• Negative dense linear orders
• \(H^1\) and presentations of finite dimensional algebras.
• Homomorphisms onto effectively separable algebras
• Convergent presentations and polygraphic resolutions of associative algebras
• Separable algorithmic representations of classical systems and their applications
• Computably separable models
• Uniform \(m\)-equivalencies and numberings of classical systems
• Logical specifications of effectively separable data models
• Classifying word problems of finitely generated algebras via computable reducibility
• \(T_1\)-separable numberings of subdirectly indecomposable algebras
• Structures of degrees of negative representations of linear orders
• Computability and universal determinability of negatively representable models
• Independence in computable algebra

This page was built for publication: \(\Pi^0_1\)-presentations of algebras

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