Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-25T19:30:58.228Z Has data issue: false hasContentIssue false
  • English
  • Français

Maximal and Cohesive vector spaces1

Published online by Cambridge University Press:  12 March 2014

J. B. Remmel
J. B. Remmel*
Affiliation:
University of California at San Diego, San Diego, California 92037
Get access Rights & Permissions [Opens in a new window]

Extract

Let N denote the natural numbers. If A ⊆ N, we write Ā for the complement of A in N. A set A ⊆ N is cohesive if (i) A is infinite and (ii) for any recursively enumerable set W either W ∩ A or ∩ A is finite. A r.e. set M ⊆ N is maximal if is cohesive.

A recursively presented vector space (r.p.v.s.) U over a recursive field F consists of a recursive set U ⊆ N and operations of vector addition and scalar multiplication which are partial recursive and under which U becomes a vector space. A r.p.v.s. U has a dependence algorithm if there is a uniform effective procedure which applied to any n-tuple ν0, ν1, …, νn−1 of elements of U determines whether or not ν0, ν1 …, νn−1 are linearly dependent. Throughout this paper we assume that if U is a r.p.v.s. over a recursive field F then U is infinite dimensional and U = N. If W ⊆ U, then we say W is recursive (r.e., etc.) iff W is a recursive (r.e., etc.) subset of N. If S ⊆ U, we write (S)* for the subspace generated by S. If V1 and V2 are subspaces of U such that V1 ∩ V2 ={} (where is the zero vector of U), then we write V1 ⊕ V2 for (V1 ∪ V2)*. If V1 ⊆ V2⊆U are subspaces, we write V2/V1 for the quotient space.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 42 , Issue 3 , September 1977 , pp. 400 - 418
Copyright
Copyright © Association for Symbolic Logic 1977

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.)

Footnotes

1

We wish to acknowledge valuable conversations with A. Nerode and G. Metakides.

References

REFERENCES

[1]Dekker, J. C. E., Countable vector spaces with recursive operations, Part I, this Journal, vol. 34 (1969), pp. 363–387.Google Scholar
[2]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. 295–310.CrossRefGoogle Scholar
[3]Metakides, G. and Nerode, A., Recursion theory and algebra, Algebra and logic, Springer-Verlag Lecture Notes, 450 (1975), pp. 209–219.CrossRefGoogle Scholar
[4]Metakides, G. and Nerode, A., Recursively enumerable vector spaces, this Journal (to appear).Google Scholar
[5]Remmel, J. B., Co-hypersimple structures, this Journal, vol. 41 (1976), pp. 611–625.Google Scholar
[6]Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[7]Yates, C. E. M., Three theorems on the degrees of recursively enumerable sets, Duke Mathematical Journal, vol. 32, (1965), pp. 461–468.CrossRefGoogle Scholar