✦ LIBER ✦

On recursive path ordering

✍ Scribed by M.S. Krishnamoorthy; P. Narendran

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 309 KB
Volume: 40
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90175-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of recursive path orde

On the complexity of recursive path orderings

✍ Wayne Snyder 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 564 KB

Recursive linear orders with recursive s

Recursive linear orders with recursive successivities

✍ Michael Moses 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 814 KB

Recursive automorphisms of recursive lin

Recursive automorphisms of recursive linear orderings

✍ Steven Schwarz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Termination proofs for term rewriting sy

Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths

✍ Andreas Weiermann 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 324 KB

Intuitionistically provable recursive we

Intuitionistically provable recursive well-orderings

✍ Harvey M. Friedman; Andre Scedrov 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Relations Intrinsically Recursive in Lin

Relations Intrinsically Recursive in Linear Orders

✍ Michael Moses 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB

6 re1ut;m on 'u, then (1) impEies ( 2 ) : \* ) These results \\-ere presented at the Conference on Iiogic imd Computation in 1984, held at :30\* JIonash University, llelbo~trnc, Australia.