Decision problems concerning properties of finite sets of equations

DOI10.2307/2273945MaRDI QIDQ3717106zbMATH OpenOpenAlexFDO

Authors Cornelia Kalfa

Publication date 1986

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2273945

zbMATH Keywords

algebraic languagefinite sets of \({\mathcal L}\)-equationsfirst-order theoryinfinite modelsmodel-completeundecidability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Equational classes, universal algebra in model theory (03C05) Equational logic, Mal'tsev conditions (08B05)

Recommendations

• Decidable properties of finite sets of equations in trivial languages
• Some undecidability results in strong algebraic languages
• scientific article; zbMATH DE number 35404
• Decision problems for language equations
• A decidable variety that is finitely undecidable

Cites work

• Base-undecidable properties of universal varieties
• Decidable properties of finite sets of equations in trivial languages
• Unsolvable problems for equational theories

Cited in

(8)

• A field guide to equational logic
• Positive indistinguishability of algebraic systems, and completeness of positive theories
• Decidable properties of finite sets of equations in trivial languages
• Some undecidability results in strong algebraic languages
• scientific article; zbMATH DE number 35404 (Why is no real title available?)
• Universal Horn Sentences and the Joint Embedding Property
• An equational logic sampler
• Families of abstract decision problems whose admissible sets intersect in a singleton

This page was built for publication: Decision problems concerning properties of finite sets of equations

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