scientific article; zbMATH DE number 1302877
From MaRDI portal
Publication:4249363
zbMath0940.03047MaRDI QIDQ4249363
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveymodulesalgorithmBoolean algebrasvector spacesconstructive modelrecursive modelrecursive automorphism groupscomputable automorphisms
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computable structure theory, computable model theory (03C57)
Related Items (12)
Orbits of maximal vector spaces ⋮ Definability of linear orders over negative equivalences ⋮ Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra ⋮ On the isomorphism problem for some classes of computable algebraic structures ⋮ Some constructions on the class of groups of computable automorphisms ⋮ Uniform \(m\)-equivalencies and numberings of classical systems ⋮ The Lattice of Computably Enumerable Vector Spaces ⋮ Simple structures with complex symmetry ⋮ Turing degrees and automorphism groups of substructure lattices ⋮ Nonpresentability of the semigroup \(\omega^\omega\) over \(\mathbb H\mathbb F(\mathbb R)\) ⋮ Partial automorphism semigroups ⋮ Automorphisms of Boolean algebras which are recursive over atoms
This page was built for publication:
