Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-26T18:22:18.256Z Has data issue: false hasContentIssue false

A r-maximal vector space not contained in any maximal vector space

Published online by Cambridge University Press:  12 March 2014

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

Extract

In [4], Metakides and Nerode define a recursively presented vector space V. over a (finite or infinite) recursive field F 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 any given n-tuple v0, …, vn−1 from V is linearly dependent. Given a subspace W of V, we write dim(W) for the dimension of W. Given subspaces V and W of V, V + W will denote the weak sum of V and W and if VW = {0) (where 0 is the zero vector of V), we write VW instead of V + W. If W ⊇ V, we write W mod V for the quotient space. An independent set AV is extendible if there is a r.e. independent set IA such that I − A is infinite and A is nonextendible if it is not the case that A is extendible.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1978

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]Kalantari, I., Major subspaces of recursively enumerable vector spaces, this Journal, vol. 43 (1978), pp. 293303.Google Scholar
[2]Kalantari, I. and Retzlaff, A., Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces, this Journal, vol. 42 (1977), pp. 481491.Google Scholar
[3]Lachlan, A. H., On the lattice of recursively enumerable sets, Transactions of the American Mathematical Society, vol. 130 (1968), pp. 127.CrossRefGoogle Scholar
[4]Metakides, G. and Nerode, A., Recursively enumerable vector spaces, Annals of Mathematical Logic, vol. 11 (1977), pp. 147172.CrossRefGoogle Scholar
[5]Remmel, J. B., Maximal and cohesive vector spaces, this Journal, vol. 42 (1977), pp. 400418.Google Scholar
[6]Remmel, J. B., On r.e. and co-r.e. vector spaces with nonextendible bases, this Journal (to appear).Google Scholar
[7]Retzlaff, A., Recursive and simple vector spaces, Ph.D. thesis, Cornell University, 1976.Google Scholar
[8]Robinson, R. W., Simplicity of recursively enumerable sets, this Journal, vol. 32 (1967), pp. 162172.Google Scholar