✦ LIBER ✦

Non-Well-Foundedness of Well-Orderable Power Sets

✍ Scribed by T. E. Forster and J. K. Truss

Book ID: 124980258
Publisher: Association for Symbolic Logic
Year: 2003
Tongue: English
Weight: 200 KB
Volume: 68
Category: Article
ISSN: 0022-4812
DOI: 10.2307/4147720

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Equivalents of Well-Foundedness

✍ Piotr Rudnicki; Andrzej Trybulec 📂 Article 📅 1999 🏛 Springer Netherlands 🌐 English ⚖ 192 KB

An algebraic study of well-foundedness

✍ Robert Goldblatt 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 948 KB

A foundational algebra (~B, f, A) consists of a heinimorphism f on a Boolean algebra ~B with a greatest solution ~ tO the condition x < f(x). The quasi-variety of foundational algebras has a decidable equational theory, and generates the same variety as the complex algebras of structures (X,/~), whe

An effective proof of the well-foundedne

An effective proof of the well-foundedness of the multiset path ordering

✍ Solange Coupet-Grimal; William Delobel 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 243 KB

The well-ordered and well-orderable subs

The well-ordered and well-orderable subsets of a set

✍ Truss, John 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

Well Quasi-Ordered Sets

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

Off-Line Parsability and the Well-Founde

Off-Line Parsability and the Well-Foundedness of Subsumption

✍ Shuly Wintner; Nissim Francez 📂 Article 📅 1999 🏛 Springer Netherlands 🌐 English ⚖ 145 KB