Review: Neil Immerman, Descriptive Complexity

@article{Lindell2001ReviewNI,
  title={Review: Neil Immerman, Descriptive Complexity},
  author={S. Lindell},
  journal={Bulletin of Symbolic Logic},
  year={2001},
  volume={7},
  pages={525 - 527}
}
  • S. Lindell
  • Published 2001
  • Mathematics
  • Bulletin of Symbolic Logic
result, showing that there cannot be any simple characterization of admissibility spectra that are realized by reals constructible from 0. Chapter 8 contains an assortment of four topics falling under the rubric applications. The first of these is Δ1-coding. In Jensen coding, a coded class of ordinals can be recovered from a coding real by recursion on cardinals, hence is Δ2-definable from the real. Friedman provides a sufficient condition for classes to be Δ1-codable. He also proves an… Expand