The Adian–Rabin theorem is a result in the field of mathematical logic, specifically in the area of decidability and the theory of algebraic structures. It addresses the properties of certain classes of roots of equations and relies on concepts from algebra and logic. In basic terms, the theorem states that for any given sequence of rational numbers, it is possible to find a computably enumerable sequence of algebraic numbers that has roots within those rational numbers.
Articles by others on the same topic
There are currently no matching articles.