论文信息 - Automorphisms of substructure lattices in recursive algebra

Automorphisms of substructure lattices in recursive algebra

Soit l'espace vectoriel completement effectif V ∞ et le treillis L(V ∞ ) des sous espaces recursivement enumerables de V ∞ . On montre que chaque automorphisme de L(V) ∞ est recursif au sens fort. On construit des espaces super-maximaux W et V tels qu'il n'existe pas d'automorphismes de W a V

David R. Guichard

[1] Jeffrey B. Remmel,et al. On r.e. and co-r.e. vector spaces with nonextendible bases , 1980, Journal of Symbolic Logic.

[2] Iraj Kalantari,et al. Maximal Vector Spaces Under Automorphisms of the Lattice of Recursively Enumerable Vector Spaces , 1977, J. Symb. Log..

[3] A. Nerode,et al. Recursion theory and algebra , 1975 .

[4] Iraj Kalantari,et al. Automorphisms of the Lattice of Recursively Enumerable Vector Spaces , 1979, Math. Log. Q..

[5] R. Soare. Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets , 1974 .

[6] David Sachs. The Lattice of Subalgebras of a Boolean Algebra , 1962, Canadian Journal of Mathematics.

[7] A. Nerode,et al. Recursively enumerable vector spaces , 1977 .

[8] R. Baer,et al. Linear algebra and projective geometry , 1952 .