Quantifier Free Definability on Infinite Algebras

DOI10.1145/2933575.2934572MaRDI QIDQ4635936zbMATH OpenOpenAlexFDO

Authors Bakh Khoussainov

Publication date 23 April 2018

Published in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2933575.2934572

zbMATH Keywords

definabilityuniversal algebracomputabilitycomputably enumerable setscongruence relationscomputable algebraequality relation

Mathematics Subject Classification ID

Basic properties of first-order languages and structures (03C07) Computable structure theory, computable model theory (03C57) Interpolation, preservation, definability (03C40)

Recommendations

• Deciding quantifier-free definability in finite algebraic structures
• Definability and decidability in infinite algebraic extensions
• \(\lambda\)-definability of free algebras
• Quantitative domains and infinitary algebras
• scientific article; zbMATH DE number 7297850
• Absolutely definable varieties of continuous algebras
• Varieties of infinitary universal algebras
• Some further results on free quantale algebras
• scientific article; zbMATH DE number 3914320
• An application of infinitary universal algebra to set theory

Cited in

(3)

• Deciding quantifier-free definability in finite algebraic structures
• A remark on $\mathscr C^\infty $ definable equivalence
• scientific article; zbMATH DE number 3920558 (Why is no real title available?)

This page was built for publication: Quantifier Free Definability on Infinite Algebras

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