The word problem for free fields

DOI10.2307/2272067zbMath0273.02027OpenAlexW2171597564WikidataQ105693506 ScholiaQ105693506MaRDI QIDQ5181672

Paul M. Cohn

Publication date: 1973

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272067

Mathematics Subject Classification ID

Connections between field theory and logic (12L99) Word problems, etc. in computability and recursion theory (03D40) Division rings and semisimple Artin rings (16Kxx)

Related Items

Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. ⋮ Non-commutative Edmonds' problem and matrix semi-invariants ⋮ Some ring-theoretic properties implied by embeddability in fields ⋮ Rational closure of the group algebra of a linearly ordered group in the division ring of Mal'tsev series ⋮ Associative rings ⋮ Progress in free associative algebras ⋮ Operator scaling: theory and applications ⋮ ON THE CONSTRUCTION OF THE FREE FIELD ⋮ Some algorithmic problems for projective planes

Cites Work

• Unnamed Item
• On the free product of associative rings
• The solution of a decision problem for several classes of rings
• Rational identities and applications to algebra and geometry
• On the immersion of an algebraic ring into a field

This page was built for publication: The word problem for free fields