Automorphisms of substructure lattices in recursive algebra (Q1078171)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Automorphisms of substructure lattices in recursive algebra |
scientific article |
Statements
Automorphisms of substructure lattices in recursive algebra (English)
0 references
1983
0 references
Let \(V_{\infty}\) be a fully effective vector space of countably infinite dimension over a recursive field and let \({\mathcal L}(V_{\infty})\) be the lattice of recursively enumerable subspaces of \(V_{\infty}\). It is shown that any automorphism of \({\mathcal L}(V_{\infty})\) is induced by a recursive semilinear transformation. By diagonalizing over the recursive semilinear transformations it is possible to show that various properties do not determine orbits. There are supermaximal subspaces A and B such that no automorphism of \({\mathcal L}(V_{\infty})\) moves A to B. This can be further strengthened so that A and B have the same dependence degree. Let \(B_{\infty}\) be the free recursive Boolean algebra on countably many generators and let \(L(B_{\infty})\) be the lattice of recursively enumerable subalgebras of \(B_{\infty}\). Every automorphism of \(L(B_{\infty})\) is induced by a recursive automorphism of \(B_{\infty}\).
0 references
fully effective vector space
0 references
lattice of recursively enumerable subspaces
0 references
recursive semilinear transformations
0 references
supermaximal subspaces
0 references
free recursive Boolean algebra
0 references
lattice of recursively enumerable subalgebras
0 references
0 references