✦ LIBER ✦

Induction and Well Ordering

✍ Scribed by Aron Pinker

Book ID: 114975572
Publisher: School Science and Mathematics Association
Year: 1976
Tongue: English
Weight: 295 KB
Volume: 76
Category: Article
ISSN: 0036-6803
DOI: 10.1111/j.1949-8594.1976.tb09258.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Arithmetic transfinite induction and rec

Arithmetic transfinite induction and recursive well-orderings

✍ Harvey M Friedman; Andrej S̆čedrov 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 591 KB

The Well-Ordering Property as an Alterna

The Well-Ordering Property as an Alternative to Mathematical Induction

✍ Paul S. Malcom 📂 Article 📅 1974 🏛 School Science and Mathematics Association 🌐 English ⚖ 112 KB

Subgraphs and well-quasi-ordering

✍ Guoli Ding 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 712 KB

## Abstract Let 𝒴 be a class of graphs and let ⪯ be the subgraph or the induced subgraph relation. We call ⪯ an __ideal__ (with respect to ⪯) if ⪯ implies that ⪯. In this paper, we study the ideals that are well‐quasiordered by ⪯. The following are our main results. If ⪯ is the subgraph relation, w

Well rewrite orderings and well quasi-or

Well rewrite orderings and well quasi-orderings

✍ Pierre Lescanne 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 791 KB

Hanf numbers and well-ordering numbers

✍ Flum, Jörg 📂 Article 📅 1972 🏛 Springer-Verlag ⚖ 821 KB

Well-ordering and choice in toposes

✍ Mawanda Mbila-Mambu 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 752 KB