✦ LIBER ✦

On the complexity of recursive path orderings

✍ Scribed by Wayne Snyder

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 564 KB
Volume: 46
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90105-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On recursive path ordering

✍ M.S. Krishnamoorthy; P. Narendran 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 309 KB

On the complexity of algorithms on recur

On the complexity of algorithms on recursive trees

✍ Jerzy Szymański 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 476 KB

Recursive complexity of the Carnap first

Recursive complexity of the Carnap first order modal logic C

✍ Amélie Gheerbrant; Marcin Mostowski 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

We consider first order modal logic C firstly defined by Carnap in "Meaning and Necessity" [1]. We prove elimination of nested modalities for this logic, which gives additionally the Skolem-Löwenheim theorem for C. We also evaluate the degree of unsolvability for C, by showing that it is exactly 0 .

A theorem on the expected complexity of

A theorem on the expected complexity of dijkstra's shortest path algorithm

✍ Kohei Noshita 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 433 KB

Recursive matching algorithms and linear

Recursive matching algorithms and linear orders on the subset lattice

✍ D.E White; S.G Williamson 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 596 KB

On the Order Complex of a Prelattice

✍ Yoav Segev 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 215 KB

In this note a prelattice L is a poset ( ϭ partially ordered set) ( L , р ) such that L ϭ L ʜ ͕ 0 , 1 ͖ is a lattice , where 0 and 1 are two new elements such that 0 Ͻ x Ͻ 1 , for all x L (see Definition 2 . 1) . Let L be a finite prelattice . The main result in this note is closely related to a re