Algorithms for Constructing Computably Enumerable Sets
tarafından
Supowit, Kenneth J. author.
Başlık
:
Algorithms for Constructing Computably Enumerable Sets
Yazar
:
Supowit, Kenneth J. author.
ISBN
:
9783031269042
Basım Bilgisi
:
1st ed. 2023.
Fiziksel Tanımlama
:
XIV, 183 p. 46 illus., 4 illus. in color. online resource.
Seri
:
Computer Science Foundations and Applied Logic,
İçerik
:
1 Index of notation and terms -- 2 Set theory, requirements, witnesses -- 3 What's new in this chapter? -- 4 Priorities (a splitting theorem) -- 5 Reductions, comparability (Kleene-Post Theorem) -- 6 Finite injury (Friedberg-Muchnik Theorem) -- 7 The Permanence Lemma -- 8 Permitting (Friedberg-Muchnik below C Theorem) -- 9 Length of agreement (Sacks Splitting Theorem) -- 10 Introduction to infinite injury -- 11 A tree of guesses (Weak Thickness Lemma) -- 12 An infinitely branching tree (Thickness Lemma) -- 13 True stages (another proof of the Thickness Lemma) -- 14 Joint custody (Minimal Pair Theorem) -- 15 Witness lists (Density Theorem) -- 16 The theme of this book: delaying tactics -- Appendix A: a pairing function -- Bibliograph -- Solutions to selected exercises.
Tüzel Kişi Ek Girişi
:
SpringerLink (Online service)
Elektronik Erişim
:
| Kütüphane | Materyal Türü | Demirbaş Numarası | Yer Numarası | [[missing key: search.ChildField.HOLDING]] | Durumu/İade Tarihi |
|---|
| Çevrimiçi Kütüphane | E-Kitap | 520324-1001 | ONLINE | | Elektronik Kütüphane |