How to prove decidability of equational theories with second-order computation analyser SOL (Q5110922): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Maude / rank | |||
Normal rank | |||
Revision as of 18:44, 29 February 2024
scientific article; zbMATH DE number 7203387
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to prove decidability of equational theories with second-order computation analyser SOL |
scientific article; zbMATH DE number 7203387 |
Statements
How to prove decidability of equational theories with second-order computation analyser SOL (English)
0 references
26 May 2020
0 references
