1. Computability in structures representing a Scott set

   • Alex M. McAllister

   Pages: 147 - 165

2. Cut elimination for a calculus with context-dependent rules

   • Birgit Elbl

   Pages: 167 - 188

3. Typed lambda-calculus in classical Zermelo-Frænkel set theory

   • Jean-Louis Krivine

   Pages: 189 - 205

4. The strength of Martin-Löf type theory with a superuniverse. Part II

   • Michael Rathjen

   Pages: 207 - 233

5. Near coherence and filter games

   • Todd Eisworth

   Pages: 235 - 242