Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-10T12:57:17.118Z Has data issue: false hasContentIssue false

On r.e. and co-r.e. vector spaces with nonextendible bases

Published online by Cambridge University Press:  12 March 2014

J. Remmel*
Affiliation:
University of California, San Diego, La Jolla, CA 92037

Extract

The concern of this paper is with recursively enumerable and co-recursively enumerable subspaces of a recursively presented vector spaceV over a (finite or infinite) recursive field F which is defined in [6] to consist of a recursive subset U of the natural numbers N and operations of vector addition and scalar multiplication which are partial recursive and under which V becomes a vector space. Throughout this paper, we will identify V with N, say via some fixed Gödel numbering, and assume V is infinite dimensional and has a dependence algorithm, i.e., there is a uniform effective procedure which determines whether or not any given n-tuple v0, …, vn−1 from V is linearly dependent. Various properties of V and its sub-spaces have been studied by Dekker [1], Guhl [3], Metakides and Nerode [6], Kalantari and Retzlaff [4], and the author [7].

Given a subspace W of V, we say W is r.e. (co-r.e.) if W(VW) is an r.e. subset of N and write dim(V) for the dimension of V. Given subspaces V, W of V, V + W will denote the weak sum of V and W and if VM = {0} (where 0 is the zero vector of V), we write VWinstead of V + W. If WV, we write Wmod V for the quotient space. An independent set AV is extendible if there is an r.e. independent set IA such that IA is infinite and A is nonextendible if it is not the case An is extendible. A r.e. subspace MV is maximal if dim(V mod M) = ∞ and for any r.e. subspace WMeither dim(W mod M) < ∞ or dim(V mod W) < ∞.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1980

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]Dekker, J. C. E., Countable vector spaces with recursive operations, Part I, this Journal, vol. 34 (1969), pp. 363387.Google Scholar
[2]Dekker, J. C. E., Two notes on vector spaces with recursive operations, Notre Dame Journal of Formal Logic, vol. 12 (1971), pp. 329334.CrossRefGoogle Scholar
[3]Guhl, R., Two types of recursively enumerable vector spaces, Ph.D. Thesis, Rutgers University, Camden, NJ, 1973.Google Scholar
[4]Kalantari, I. and Retzlaff, T., Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces, this Journal, vol. 42 (1977), pp. 481491.Google Scholar
[5]Martin, D. A., Classes of recursively enumerable sets and degrees of unsolvability, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 12 (1966), pp. 295310.CrossRefGoogle Scholar
[6]Metakides, G. and Nerode, A., Recursively enumerable vector spaces, Annals of Mathematical Logic, vol.11 (1977), pp. 147172.CrossRefGoogle Scholar
[7]Remmel, J., Maximal and cohesive vector spaces, this Journal, vol. 42 (1977), pp. 400418.Google Scholar
[8]Sacks, G., Degrees of unsolvabiiity, Princeton University Press, Princeton, NJ, 1966.Google Scholar
[9]Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[10]Yates, C. E. M., Three theorems on the degrees of recursively enumerable sets, Duke Mathematical Journal, vol. 32 (1965), pp. 461468.CrossRefGoogle Scholar