How to prove decidability of equational theories with second-order computation analyser SOL (Q5110922): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0956796819000157 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2996342526 / rank | |||
Normal rank | |||
Latest revision as of 10:40, 30 July 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
0 references
0 references
0 references
0 references
0 references
0 references
