Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-25T19:17:20.808Z Has data issue: false hasContentIssue false
  • English
  • Français

Recursive elements and constructive extensions of computable local integral domains

Published online by Cambridge University Press:  12 March 2014

Glen H. Suter
Glen H. Suter*
Affiliation:
Albany State College, Albany, Georgia 31705
Get access Rights & Permissions [Opens in a new window]

Extract

With reservations, one can think of abstract algebra as the study of what consequences can be drawn from the axioms associated with certain concrete algebraic structures. Two important examples of such concrete algebraic structures are the integers and the rational numbers. The integers and the rational numbers have two properties which are not in general mirrored in the abstract axiom systems associated with them. That is, the integers and the rational numbers both have effectively computable metrics and their algebraic operations are effectively computable. The study of abstract algebraic systems which possess effectively computable algebraic operations has produced many interesting results. One can think of a computable algebraic structure as one whose elements have been labeled by the set of positive integers and whose operations are effectively computable. The formal definition of computable local integral domain will be given in §3. Some specific computable structures which have been studied are the integers, the rational numbers, and the rational numbers with p-adic valuation. Computable structures were studied in general by Rabin [12]. This paper concerns computable local integral domains as exemplified by the local integral domain Zp. Zp is the localization of the integers with respect to the maximal prime ideal generated by the positive prime p. We should note that the concept of local integral domain is not first order.

Let the ordered pair (Q, M) stand for a local ring, where Q is the local ring and M is the unique maximal prime ideal of Q. Since most of my results are proving the existence of certain effective procedures, the assumption that Q has a principal maximal ideal M (rather than M has n generators) greatly simplifies many of the proofs.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 38 , Issue 2 , June 1973 , pp. 272 - 290
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

BIBLIOGRAPHY

[1]Alton, Donald A. and Madison, E. W., Computability of Boolean algebras and their extensions (to appear).Google Scholar
[2]Dubrovsky, Diana Lydia, Computability in p-adically closed fields and nonstandard arithmetic, Ph.D. Thesis, University of California, Los Angeles, 1971.Google Scholar
[3]Frölich, A. and Shephersdon, J., Effective procedures in field theory, Transactions of the Royal Philosophical Society of London, Series A, vol. 248 (1956), pp. 407–432.Google Scholar
[4]Kloster, Stephen C., Constructivity in algebra: Computable sequences in L-groups and fields, Ph.D. Thesis, University of Iowa, Iowa City, 1971.Google Scholar
[5]Lachlan, A. H. and Madison, E. W., Computable fields and arithmetically definable ordered fields, Proceedings of the American Mathematical Society, vol. 24 (1970), pp. 803–807.CrossRefGoogle Scholar
[6]Luxemburg, W. A. J., Applications of model theory to algebra, analysis and probability, Holt, Rinehart and Winston, New York, 1969.Google Scholar
[7]Madison, E. W., Computable algebraic structures and nonstandard arithmetic, Transactions of the American Mathematical Society, vol. 130 (1968), pp. 38–54.CrossRefGoogle Scholar
[8]Madison, E. W., Some remarks on computable (non-archimedian) ordered fields, Journal of the London Mathematical Society (2), vol. 3 (1971), pp. 304–308.CrossRefGoogle Scholar
[9]Nagata, Masoyoshi, Local rings, Interscience Tracts in Pure and Applied Mathematics, No. 13, Interscience, New York, 1962.Google Scholar
[10]Nagata, Masoyoshi, Some studies on semilocal rings, Nagoya Matematical Journal, vol. 3 (1951), pp. 23–30.CrossRefGoogle Scholar
[11]Northcott, D. G., Ideal theory, Cambridge University Press, Oxford, 1968.Google Scholar
[12]Rabin, M. O., Computable algebra, general theory and theory of computable fields, Transactions of the American Mathematical Society, vol. 95 (1960), pp. 341–360.Google Scholar
[13]Rice, H. G., Recursive real numbers, Proceedings of the American Mathematical Society, vol. 5 (1954), pp. 784–791.CrossRefGoogle Scholar
[14]Rodgers, Hartley Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[15]van der Waerden, B. L., Algebra, Vols. 1 and 2, Frederick Ungar Publishers, New York, 1970.Google Scholar
[16]Zariski, O. and Samuel, P., Commutative algebra, Vols. I and II, Van Nostrand, Princeton, N.J., 1967.Google Scholar