Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-13T01:37:54.503Z Has data issue: false hasContentIssue false
  • English
  • Français

Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces

Published online by Cambridge University Press:  12 March 2014

Iraj Kalantari  and
Allen Retzlaff
Iraj Kalantari
Affiliation:
Cornell University, Ithaca. NY 14853
Allen Retzlaff
Affiliation:
Cornell University, Ithaca. NY 14853
Get access Rights & Permissions [Opens in a new window]

Extract

The area of interest of this paper is recursively enumerable vector spaces; its origins lie in the works of Rabin [16], Dekker [4], [5], Crossley and Nerode [3], and Metakides and Nerode [14]. We concern ourselves here with questions about maximal vector spaces, a notion introduced by Metakides and Nerode in [14]. The domain of discourse is V∞ a fully effective, countably infinite dimensional vector space over a recursive infinite field F.

By fully effective we mean that V∞, under a fixed Gödel numbering, has the following properties:

(i) The operations of vector addition and scalar multiplication on V∞ are represented by recursive functions.

(ii) There is a uniform effective procedure which, given n vectors, determines whether or not they are linearly dependent (the procedure is called a dependence algorithm).

We denote the Gödel number of x by ⌈x⌉ By taking {εn ∣ n > 0} to be a fixed recursive basis for V∞, we may effectively represent elements of V∞ in terms of this basis. Each element of V∞ may be identified uniquely by a finitely-nonzero sequence from F Under this identification, εn corresponds to the sequence whose n th entry is 1 and all other entries are 0. A recursively enumerable (r.e.) space is a subspace of V∞ which is an r.e. set of integers, ℒ(V∞) denotes the lattice of all r.e. spaces under the operations of intersection and weak sum. For V, W ∈ ℒ(V∞), let V mod W denote the quotient space. Metakides and Nerode define an r.e. space M to be maximal if V∞ mod M is infinite dimensional and for all V ∈ ℒ(V∞), if V ⊇ M then either V mod M or V∞ mod V is finite dimensional. That is, M has a very simple lattice of r.e. superspaces.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 42 , Issue 4 , December 1977 , pp. 481 - 491
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.)

References

REFERENCES

[1]Birkoff, G., Lattice theory, Colloquium Publications, vol. 25, American Mathematical Society, Providence, R.I., 1967.Google Scholar
[2]Crossley, J. N. and Nerode, A., Combinatorial functors, monograph, Springer-Verlag, Berlin, 1974.CrossRefGoogle Scholar
[3]Crossley, J. N. and Nerode, A., Effective dimension, Journal of Algebra (to appear).Google Scholar
[4]Dekker, J. C. E., Countable vector spaces with recursive operations. Part I, this Journal, vol. 34 (1969), pp. 363–387.Google Scholar
[5]Dekker, J. C. E., Countable vector spaces with recursive operations. Part II, this Journal, vol. 36 (1971), pp. 477–495.Google Scholar
[6]Friedberg, R. M., Three theorems on recursive enumeration, this Journal, vol. 23 (1958), pp. 309–316.Google Scholar
[7]Frölich, A. and Shepherdson, J. C., Effective procedures in field theory, Philosophical Transactions of the Royal Society of London. Series A, vol. 284 (1955), pp. 407–432.Google Scholar
[8]Guhl, R., Two types of recursively enumerable vector spaces, Ph. D. dissertation, Rutgers University, New Brunswick, N.J., 1973.Google Scholar
[9]Kalantari, I., Structural properties of the lattice of recursively enumerable vector spaces, Ph.D. dissertation, Cornell University, Ithaca, N.Y., 1976.Google Scholar
[10]Kalantari, I., Automorphisms of the lattice of recursively enumerable vector spaces (in preparation).Google Scholar
[11]Kalantari, I., Major subspaces, this Journal (to appear).Google Scholar
[12]Lachlan, A. H., On the lattice of recursively enumerable sets, Transactions of the American Mathematical Society, vol. 130 (1968), pp. 1–37.CrossRefGoogle Scholar
[13]Metakides, G. and Nerode, A., Recursion theory and algebra, Algebra and logic, Springer-Verlag Lecture Notes, 450 (1975), pp. 209–219.CrossRefGoogle Scholar
[14]Recursively enumerable vector spaces, this Journal, (to appear).Google Scholar
[15]Post, E. L., Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, vol. 50 (1944), pp. 284–316.CrossRefGoogle Scholar
[16]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
[17]Remmel, J., Co-recursively enumerable structures, Ph.D. dissertation, Cornell University, Ithaca, N.Y., 1974.Google Scholar
[18]Remmel, J., Cohesive spaces, this Journal (to appear).Google Scholar
[19]Remmel, J., On vector spaces with no extendible basis, this Journal (to appear).Google Scholar
[20]Retzlaff, A., Recursive and simple vector spaces, Ph.D. dissertation, Cornell University, Ithaca, N.Y., 1976.Google Scholar
[21]Remmel, J., Direct summands of r.e. vector spaces (in preparation).Google Scholar
[22]Remmel, J., Hyperhypersimple vector spaces, this Journal (to appear).Google Scholar
[23]Rogers, H., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1968.Google Scholar
[24]Soare, R. I., Automorphisms of the lattice of recursively enumerable sets Part I: Maximal sets, Annals of Mathematics, vol. 100 (1974), pp. 80–120.CrossRefGoogle Scholar
[25]van der Waerden, B. L., Modern algebra, Volumes I and II (English translation), Ungar, New York, 1949 and 1950.Google Scholar