Two algorithms to decide Quantifier-free Definability in Finite Algebraic Structures (Q6431344)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two algorithms to decide Quantifier-free Definability in Finite Algebraic Structures |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two algorithms to decide Quantifier-free Definability in Finite Algebraic Structures |
scientific article |
Statements
29 March 2023
0 references
cs.LO
0 references
math.LO
0 references
