Unification in pseudo-linear sort theories is decidable (Q4647533)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7001923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8894062
0 references
0 references
0.85639465
0 references
0.8533652
0 references
0.85072845
0 references
