Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-22T20:28:05.808Z Has data issue: false hasContentIssue false

The word problem for division rings

Published online by Cambridge University Press:  12 March 2014

Angus Macintyre*
Affiliation:
King's College, Old Aberdeen, Scotland

Extract

In this paper we prove that the word problem for division rings is recursively unsolvable. Our proof relies on the corresponding result for groups [7], [28], and makes essential use of P. M. Cohn's recent work [11], [13], [15], [16] on division rings.

The word problem for groups is usually formulated in terms of group presentations or finitely presented groups, as in [7], [24], [28], [30]. An equivalent formulation, in terms of the universal Horn sentences of group theory, is mentioned in [32]. This formulation makes sense for arbitrary first-order theories, and it is with respect to this formulation that we show that the word problem for division rings has degree 0′.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1973

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Adjan, S. I., The algorithmic unsolvability of problems concerning certain properties of groups (Russian), Doklady Akademii Nauk SSSR, vol. 103 (1955), pp. 533535.Google Scholar
[2]Amitsur, S. A., Rational identities and applications to algebra and geometry, Journal of Algebra, vol. 3 (1966), pp. 304359.Google Scholar
[3]Barwise, J. and Robinson, A., Completing theories by forcing, Annals of Mathematical Logic, vol. 2 (1970), pp. 119142.CrossRefGoogle Scholar
[4]Baumslag, G., Boone, W. W. and Neumann, B. H., Some unsolvable problems about elements and subgroups of groups, Mathematica Scandinavica, vol. 7 (1959), pp. 199201.Google Scholar
[5]Boffa, M. and van Praag, P., Sur les corps génériques, Comptes Rendus. Série A, vol. 274 (1972), p. 1325.Google Scholar
[6]Boone, W. W., Decision problems about algebraic systems as a whole, and recursively enumerable degrees of unsolvability, Contributions to mathematical logic (Schütte, K., Editor), North-Holland, Amsterdam, 1968.Google Scholar
[7]Boone, W. W., The word problem, Annals of Mathematics, vol. 70 (1959), pp. 207265.CrossRefGoogle Scholar
[8]Boone, W. W. and Rogers, H. Jr., On a problem of J. H. C. Whitehead and a problem of Alonzo Church, Mathematica Scandinavica, vol. 19 (1966), pp. 185192.Google Scholar
[9]Britton, J. L., The word problem, Annals of Mathematics, vol. 77 (1963), pp. 1632.CrossRefGoogle Scholar
[10]Clapham, C. R. J., Finitely presented groups with word problems of arbitrary degrees of unsolvability, Proceedings of the London Mathematical Society (3), vol. 14 (1964), pp. 633676.Google Scholar
[11]Cohn, P. M., The embedding of firs in skew fields, Proceedings of the London Mathematical Society, vol. 23 (1971), pp. 193213.CrossRefGoogle Scholar
[12]Cohn, P. M., Free rings and their relations, London Mathematical Society Monographs. Vol. 2, Academic Press, London, 1972.Google Scholar
[13]Cohn, P. M., Universal skew fields of fractions, Symposia Mathematica, vol. 8 (1962), pp. 135148.Google Scholar
[14]Cohn, P. M., On the free product of associative rings, Mathematische Zeitschrift, vol. 71 (1959), pp. 380398.CrossRefGoogle Scholar
[15]Cohn, P. M., Skew fields of fractions, and the prime spectrum of a general ring, Lectures on rings and modules (Hofmann, K. H., Editor) Springer Lecture Notes, No. 246, 1972.CrossRefGoogle Scholar
[16]Cohn, P. M., The free product of skew fields (to appear).Google Scholar
[17]Collins, D. J., Recursively enumerable degrees and the conjugacy problem, Acta Mathematica, vol. 122 (1969), pp. 115160.Google Scholar
[18]Fridman, A. A., Degrees of unsolvability of the problem of identity in finitely presented groups, Soviet Mathematics, vol. 3 (1962), pp. 17331737.Google Scholar
[19]Fuchs, L., Partially ordered algebraic systems, Pergamon Press, Oxford, 1963.Google Scholar
[20]Higman, G., Subgroups of finitely presented groups, Proceedings of the Royal Society, London. Series A, vol. 262 (1961), pp. 455475.Google Scholar
[21]Jacobson, N., Structure of rings, American Mathematical Society Colloquium Publications, vol. 37, American Mathematical Society, Providence, R.I., 1964.Google Scholar
[22]Macintyre, A., Omitting quantifier-free types in generic structures, this Journal, vol. 37 (1972), pp. 512520.Google Scholar
[23]Macintyre, A., On algebraically closed division rings, Annals of Mathematical Logic (submitted).Google Scholar
[24]Magnus, W., Karrass, A. and Solitar, D., Combinatorial group theory, Interscience, New York, 1966.Google Scholar
[25]Miller, C. W. III, Group-theoretic decision problems and their classifications, Annals of Mathematics Studies, Princeton University Press, Princeton, N.J., 1972.Google Scholar
[26]Miller, C. W. III, The word problem in quotients of a group (unpublished).Google Scholar
[27]Novikov, P. S., Unsolvability of the conjugacy problem in the theory of groups (Russian), Izvestija Akademii Nauk SSSR. Serija Matematiceskaja, vol. 18 (1954), pp. 485524.Google Scholar
[28]Novikov, P. S., On the algorithmic unsolvability of the word problem in group theory (Russian), Trudy Matematiceskogo Instituta im V. A. Steklova, no. 44.Google Scholar
[29]Rabin, M. O., Recursive unsolvability of group-theoretic problems, Annals of Mathematics, vol. 67 (1958), pp. 172194.Google Scholar
[30]Rotman, J. J., The theory of groups, Allyn and Bacon, Boston, 1965.Google Scholar
[31]Sacerdote, G., Some logical problems in group theory, Ph.D. thesis, University of Illinois Urbana, Ill., 1971.Google Scholar
[32]Tarski, A., Equational logic, Contributions to mathematical logic (Schütte, K., Editor), North-Holland, Amsterdam, 1968.Google Scholar
[33]Wheeler, W. H., Algebraically closed division rings, forcing and the analytical hierarchy, Ph.D. thesis, Yale University, New Haven, Conn., 1972.Google Scholar