Logical complexity of reducts of elementary algebraic classes
From MaRDI portal
Cites work
- Characterization results for d-Horn formulas, or on formulas that are true on dual reduced products
- Discriminator varieties and symbolic computation
- Equational Bases for Lattice Theories.
- scientific article; zbMATH DE number 3904558 (Why is no real title available?)
- scientific article; zbMATH DE number 3792252 (Why is no real title available?)
- scientific article; zbMATH DE number 1226187 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 3415409 (Why is no real title available?)
- scientific article; zbMATH DE number 3079597 (Why is no real title available?)
- Model theory
- On classes of structures axiomatizable by universal d-Horn sentences and universal positive disjunctions
- The Spectrum of a Variety
- Two Identities for Lattices
This page was built for publication: Logical complexity of reducts of elementary algebraic classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228076)