Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets (Q6573396)
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: Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets |
scientific article; zbMATH DE number 7881838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets |
scientific article; zbMATH DE number 7881838 |
Statements
Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets (English)
0 references
16 July 2024
0 references
systems of equations
0 references
computational complexity
0 references
partially ordered set
0 references
poset
0 references
equationally Noetherian property
0 references
cones
0 references
solvability
0 references
