Abstract
The priority tree, which we call a “tree of guesses,” is introduced, and used for a construction involving infinite injury. The associated concept of “\(\sigma \)-believability” is employed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
See the comment in the Afternotes section about why this result is called a “lemma” in the literature but a “theorem” in this chapter.
- 2.
Some students have found this lightning bolt metaphor to be helpful. If you don’t, then ignore it.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Supowit, K.J. (2023). A Tree of Guesses (Weak Thickness Lemma). In: Algorithms for Constructing Computably Enumerable Sets. Computer Science Foundations and Applied Logic. Birkhäuser, Cham. https://doi.org/10.1007/978-3-031-26904-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-031-26904-2_11
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-031-26903-5
Online ISBN: 978-3-031-26904-2
eBook Packages: Computer ScienceComputer Science (R0)