The theory of total unary RPO is decidable
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | First International Conference on Computational Logic - Cl'2000 |
| Author | Narendran, Paliath, Rusinowitch, Michaël |
| Maintainer | CCSD |
| Last Updated | May 5, 2026, 11:08 (UTC) |
| Created | May 5, 2026, 11:08 (UTC) |
| Identifier | inria-00099166 |
| Language | en |
| contributor | Department of Computer Science [Santa Barbara] ; University of California [Santa Barbara] (UC Santa Barbara) ; University of California (UC)-University of California (UC) |
| creator | Narendran, Paliath |
| date | 2000-05-05T00:00:00 |
| harvest_object_id | 34302db8-f11a-4058-b082-b990d4d4f76a |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2025-11-04T00:00:00 |
| set_spec | type:COMM |