Computable formal contexts

DOI10.1016/J.TCS.2025.115457MaRDI QIDQ6914021zbMATH OpenFDO

Authors H. S. Wu

Publication date 17 October 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115457

zbMATH Keywords

arrow relationscomputability theoryformal conceptsformal contextsreducing formal contexts

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30)

Cites work

• Computability and randomness
• Computable abelian groups
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable completely decomposable groups
• Effective content of field theory
• Effective procedures in field theory
• Effectively categorical abelian groups
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3478856 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• Ideals in computable rings
• Infinite dimensional proper subspaces of computable vector spaces
• On the complexity of radicals in noncommutative rings
• Recursively enumerable vector spaces
• Reverse Mathematics
• Subspaces of computable vector spaces
• The computational complexity of torsion-freeness of finitely presented groups
• The decomposability problem for torsion-free abelian groups is analytic-complete
• The isomorphism problem for computable Abelian _p-groups of bounded length
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Turing computability. Theory and applications

This page was built for publication: Computable formal contexts

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