Abstract
Some handy notation is introduced, as well as a small – but quite useful—lemma about computations with c.e. oracles.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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). The Permanence 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-26904-2_6
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)