✦ LIBER ✦

Well rewrite orderings and well quasi-orderings

✍ Scribed by Pierre Lescanne

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 791 KB
Volume: 14
Category: Article
ISSN: 0747-7171
DOI: 10.1016/0747-7171(92)90015-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Gap Embedding for Well-Quasi-Orderings

✍ Nachum Dershowitz; Iddo Tzameret 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 683 KB

Constructive Well-Orderings

✍ Robin J. Grayson 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 564 KB

The constructions and proofs of this paper are to be understood as taking place in some kind of basic set theory or type theory, based on intuitionistic logic. \lie assunie a set N of natural numbers, satisfying HEYTING'S arithmetic (with full induction) ; we can form products of sets, and subsets o

Well-partial orderings and hierarchies

✍ D.H.J de Jongh; Rohit Parikh 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 722 KB

Intuitionistically provable recursive we

Intuitionistically provable recursive well-orderings

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

On Scott's thesis for domains of informa

On Scott's thesis for domains of information and well-quasi-orderings

✍ Claudia Böttinger 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 860 KB

Well Quasi-Ordered Sets

✍ F. Richman; G. Stolzenberg 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 322 KB