Abstract
The priority tree used in Chap. 11 was binary, that is, each node had exactly two children. The priority tree employed here is infinitely branching, that is, each node has infinitely many children.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Boolean algebra is a joy forever, in my opinion.
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). An Infinitely Branching Tree (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_12
Download citation
DOI: https://doi.org/10.1007/978-3-031-26904-2_12
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)