Algorithmic properties of models with signatures containing two unary functional symbols

zbMATH Open1249.03054MaRDI QIDQ2885250FDOQ2885250

Authors: E. B. Fokina 

Publication date: 21 May 2012

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

Recommendations

• Computability Over Structures of Infinite Signature
• scientific article; zbMATH DE number 4093434
• scientific article; zbMATH DE number 3851055
• scientific article; zbMATH DE number 3921962
• scientific article; zbMATH DE number 638366

zbMATH Keywords

enumerationcomputabilitycategorical structure

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cited In (1)

• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Algorithmic properties of models with signatures containing two unary functional symbols

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