Name
Abstract | ||
|---|---|---|
We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating well- foundedness of unions of relations. To that end, we develop the notion of a constricting sequence. These results can be applied, for example, to generic path orderings used in termination proofs. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-01748-3_5 | Birthday ... |
Keywords | Field | DocType |
termination proof,generic path,lazy commutation,combinatorial commutation property | Path-ordering,Discrete mathematics,Mathematical proof,Mathematics,Commutation | Conference |
Volume | ISSN | Citations |
5533 | 0302-9743 | 1 |
PageRank | References | Authors |
0.43 | 28 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nachum Dershowitz | 1 | 2818 | 473.00 |