Automorphisms, definable relations, and covers of elements of the computability potential scale for all finite algebras

DOI10.1007/S10469-008-9017-XMaRDI QIDQ3546129zbMATH OpenOpenAlexFDO

Authors A. G. Pinus

Publication date 18 December 2008

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10469-008-9017-x

zbMATH Keywords

automorphismfinite algebradefinable subsetcomputability potential scale

Mathematics Subject Classification ID

Automorphisms and endomorphisms of algebraic structures (08A35) Applications of universal algebra in computer science (08A70)

Recommendations

• scientific article; zbMATH DE number 2007821
• On the elementary theory of the scale of the computability potentials of all finite algebras
• Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
• scientific article; zbMATH DE number 1531936
• scientific article; zbMATH DE number 2203377
• scientific article; zbMATH DE number 5379385
• Automorphisms of Boolean algebras definable by fixed elements
• Universal algebras and ideals of the scale of computability potentials of all finite algebras
• Full satisfaction classes, definability, and automorphisms
• scientific article; zbMATH DE number 5066508

Cited in

(5)

• On the scale of local computability potentials of algebras
• Definable Automorphisms of P(ω)/fin
• On the elementary theory of the scale of the computability potentials of all finite algebras
• scientific article; zbMATH DE number 2203377 (Why is no real title available?)
• Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets

This page was built for publication: Automorphisms, definable relations, and covers of elements of the computability potential scale for all finite algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546129)