Algorithms for Constructing Computably Enumerable Sets
by
 
Supowit, Kenneth J. author.

Title
Algorithms for Constructing Computably Enumerable Sets

Author
Supowit, Kenneth J. author.

ISBN
9783031269042

Edition
1st ed. 2023.

Physical Description
XIV, 183 p. 46 illus., 4 illus. in color. online resource.

Series
Computer Science Foundations and Applied Logic,

Contents
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.

Added Corporate Author
SpringerLink (Online service)

Electronic Access
https://doi.org/10.1007/978-3-031-26904-2


LibraryMaterial TypeItem BarcodeShelf Number[[missing key: search.ChildField.HOLDING]]Status
Online LibraryE-Book520324-1001ONLINEElektronik Kütüphane