Some decidable theories with finitely many covers which are decidable and algorithmically found

DOI10.4064/CM-67-1-61-67zbMath0819.08003OpenAlexW322692490MaRDI QIDQ4318107

Cornelia Kalfa

Publication date: 24 August 1995

Published in: Colloquium Mathematicum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/210263

zbMATH Keywords

coversdecidabilityfinite basisalgebraic languagelattice of equational theoriesrecursive first-order language

Mathematics Subject Classification ID

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

This page was built for publication: Some decidable theories with finitely many covers which are decidable and algorithmically found