Satisfiability of systems of ordinal notations with the subterm property is decidable (Q4036585)
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 176755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Satisfiability of systems of ordinal notations with the subterm property is decidable |
scientific article; zbMATH DE number 176755 |
Statements
18 May 1993
0 references
satisfiability
0 references
ordered resolution
0 references
paramodulation
0 references
rewrite orderings on terms
0 references
solving ordering constraints between terms
0 references
constrained logic programming
0 references
multiset path ordering
0 references
recursive path ordering
0 references
0.7987561225891113
0 references
0.7937617897987366
0 references
0.7861067056655884
0 references
0.7844577431678772
0 references
0.7813724875450134
0 references
Satisfiability of systems of ordinal notations with the subterm property is decidable (English)
0 references
