Automorphisms of substructure lattices in recursive algebra
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}\).
- Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra
- The lattice of recursively enumerable substructures of an effective closure system
- scientific article; zbMATH DE number 4035813
- scientific article; zbMATH DE number 3914305
- scientific article; zbMATH DE number 4193662
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Automorphisms of the Lattice of Recursively Enumerable Vector Spaces
- scientific article; zbMATH DE number 3478856 (Why is no real title available?)
- scientific article; zbMATH DE number 3078149 (Why is no real title available?)
- Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
- On r.e. and co-r.e. vector spaces with nonextendible bases
- Recursively enumerable vector spaces
- The Lattice of Subalgebras of a Boolean Algebra
- Quasi-simple relations in copies of a given recursive structure
- The lattice of recursively enumerable substructures of an effective closure system
- Turing degrees and automorphism groups of substructure lattices
- Automorphisms of subword-posets
- Automorphisms of the lattice of _1⁰ classes; perfect thin classes and anc degrees
- Orbits of maximal vector spaces
- The Lattice of Computably Enumerable Vector Spaces
- Orbits of Creative Subspaces
- More undecidable lattices of Steinitz exchange systems
- Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra
- scientific article; zbMATH DE number 4150125 (Why is no real title available?)
- Automorphisms of supermaximal subspaces
- scientific article; zbMATH DE number 3914305 (Why is no real title available?)
- Automorphisms and Recursive Structures
- Recursion theory in a lower semilattice
- scientific article; zbMATH DE number 1484314 (Why is no real title available?)
- Extensions of certain partial automorphisms of \(\mathcal{L}^{\ast}(V_{\infty })\)
- HOMOGENEOUS BIJECTIONS THAT INDUCE AUTOMORPHISMS OF THE SUBMODULE LATTICE
- 2005–06 Winter Meeting of the Association for Symbolic Logic
- Recursive properties of relations on models
- A note on r-maximal subspaces of \(V_{\infty}\)
- A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\)
This page was built for publication: Automorphisms of substructure lattices in recursive algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078171)
