Rekursive Algebren mit Kettenbedingungen

DOI10.1002/MALQ.19740200105MaRDI QIDQ4078005zbMATH OpenOpenAlexFDO

Authors Walter Baur

Publication date 1974

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19740200105

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Finite rings and finite-dimensional associative algebras (16P10) Applications of computability and recursion theory (03D80) Word problems, etc. in computability and recursion theory (03D40)

Cited in

(19)

• Learnability and positive equivalence relations
• Computably separable models
• Infinite dimensional proper subspaces of computable vector spaces
• Learning algebraic structures from text
• Positive algebras with Noetherian congruence lattices
• The computability, definability, and proof theory of Artinian rings
• Positive algebras with congruences of finite index
• Nonconstructive negative algebras with finiteness conditions
• Positive algebras with countable congruence lattices
• Reducibilities among equivalence relations induced by recursively enumerable structures
• Ideal membership in polynomial rings over the integers
• Learnability and positive equivalence relations
• Boolean algebras realized by c.e. equivalence relations
• Chain conditions in computable rings
• On computably enumerable structures
• The complexity of primes in computable unique factorization domains
• On constructing bases for ideals in polynomial rings over the integers
• Separable algorithmic representations of classical systems and their applications
• Graphs realised by r.e. equivalence relations

This page was built for publication: Rekursive Algebren mit Kettenbedingungen

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