Rekursive Algebren mit Kettenbedingungen

DOI10.1002/malq.19740200105zbMath0317.02050OpenAlexW2074803653MaRDI QIDQ4078005

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

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

Related Items (19)

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

This page was built for publication: Rekursive Algebren mit Kettenbedingungen