Unification in pseudo-linear sort theories is decidable (Q4647533): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-61511-3_99 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1562994860 / rank | |||
Normal rank | |||
Revision as of 20:02, 19 March 2024
scientific article; zbMATH DE number 7001923
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unification in pseudo-linear sort theories is decidable |
scientific article; zbMATH DE number 7001923 |
Statements
Unification in pseudo-linear sort theories is decidable (English)
0 references
15 January 2019
0 references
function symbol
0 references
decidability result
0 references
ground term
0 references
tree automaton
0 references
unification problem
0 references
