Computer Science Logic

DOI10.1007/11538363zbMATH Open1136.03304OpenAlexW2479351976MaRDI QIDQ5394584FDOQ5394584

Authors: Bakhadyr Khoussainov, Sasha Rubin 

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11538363

Recommendations

• scientific article; zbMATH DE number 4123793
• Decidability of elementary theories of certain finitely defined algebras
• scientific article; zbMATH DE number 1095799
• scientific article; zbMATH DE number 176756
• scientific article; zbMATH DE number 4055689

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Partial algebras (08A55) Quantifier elimination, model completeness, and related topics (03C10)

Cited In (3)

• The decidability of some classes of Stone algebras
• The existence of a near-unanimity term in a finite algebra is decidable
• Title not available (Why is that?)

This page was built for publication: Computer Science Logic

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