DETERMINING WHETHER ${\mathsf V}({\bf A})$ HAS A MODEL COMPANION IS UNDECIDABLE

DOI10.1142/S0218196704001748zbMath1087.03018MaRDI QIDQ5692241

Ross Willard

Publication date: 27 September 2005

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

undecidabilityvarietyfinite algebramodel companion

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Model theory of finite structures (03C13) Equational classes, universal algebra in model theory (03C05) Varieties (08B99)

Cites Work

• Complete theories
• On McKenzie's method
• A RESIDUALLY SMALL, FINITELY GENERATED, SEMI-SIMPLE VARIETY WHICH IS NOT RESIDUALLY FINITE
• THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
• THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
• Model-completions and modules

This page was built for publication: DETERMINING WHETHER ${\mathsf V}({\bf A})$ HAS A MODEL COMPANION IS UNDECIDABLE