Similar Items: Definability of linear equation systems over groups and rings
- Formalized linear algebra over Elementary Divisor Rings in Coq
- Existential Definability over the Subword Ordering
- Definable decompositions for graphs of bounded linear cliquewidth
- Datatype defining rewrite systems for naturals and integers
- Linear equations for unordered data vectors in $[D]^kto{}Z^d$
- The complexity of linear-time temporal logic over the class of ordinals