Algorithmic recognizability of the finiteness property of finite-definite systems

MaRDI QIDQ2885204zbMATH OpenFDO

Authors E. N. Pavlovskij

Publication date 21 May 2012

Published in Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)

zbMATH Keywords

finite computable modelmodel-theoretic properties

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Finitary algebras (08A62)

Recommendations

• Algorithmically finite groups.
• Unifiability and admissibility in finite algebras
• scientific article; zbMATH DE number 1899886
• On the existence of an algorithm for recognizing the A-completeness of systems containing all one-place bounded-determinate functions.
• The undecidability of the definability of principal subcongruences

Cited in

(2)

• scientific article; zbMATH DE number 3887686 (Why is no real title available?)
• scientific article; zbMATH DE number 4201644 (Why is no real title available?)

This page was built for publication: Algorithmic recognizability of the finiteness property of finite-definite systems

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