Automorphisms of substructure lattices in recursive algebra
From MaRDI portal
Publication:1078171
DOI10.1016/0168-0072(83)90053-2zbMath0596.03042OpenAlexW2035335672MaRDI QIDQ1078171
Publication date: 1983
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(83)90053-2
fully effective vector spacefree recursive Boolean algebralattice of recursively enumerable subalgebraslattice of recursively enumerable subspacesrecursive semilinear transformationssupermaximal subspaces
Related Items
Orbits of maximal vector spaces ⋮ Orbits of Creative Subspaces ⋮ Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra ⋮ Quasi-simple relations in copies of a given recursive structure ⋮ Recursion theory in a lower semilattice ⋮ The Lattice of Computably Enumerable Vector Spaces ⋮ 2005–06 Winter Meeting of the Association for Symbolic Logic ⋮ Turing degrees and automorphism groups of substructure lattices ⋮ Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees ⋮ Recursive properties of relations on models ⋮ A note on r-maximal subspaces of \(V_{\infty}\) ⋮ Automorphisms of supermaximal subspaces ⋮ More undecidable lattices of Steinitz exchange systems
Cites Work
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- The Lattice of Subalgebras of a Boolean Algebra
- Automorphisms of the Lattice of Recursively Enumerable Vector Spaces
- On r.e. and co-r.e. vector spaces with nonextendible bases
- Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
- Recursively enumerable vector spaces
- Unnamed Item
- Unnamed Item
