Skip to Main content Skip to Navigation
Conference papers

The theory of total unary RPO is decidable

Paliath Narendran 1 Michaël Rusinowitch 2
2 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Résumé : Nous prouvons que la théorie du premier ordre du rpo est décidable dans le cas unaire et total.
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:51:29 AM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM


  • HAL Id : inria-00099166, version 1



Paliath Narendran, Michaël Rusinowitch. The theory of total unary RPO is decidable. First International Conference on Computational Logic - Cl'2000, 2000, Londres, UK, pp.660-672. ⟨inria-00099166⟩



Record views