Table of Contents:
  • Chapter Jeremy Avigad Ordinal analysis without proofs
  • chapter Wilfried Buchholz Relating ordinals to proofs in a perspicuous way
  • chapter Harvey M. Friedman Internal finite tree embeddings
  • chapter Ulrich Kohlenbach Foundational and mathematical uses of higher types
  • chapter Grigori Mints The epsilon substitution method and continuity
  • chapter Predicativity: The outer limits
  • part PART II. LOGIC AND COMPUTATION
  • chapter A pragmatic interpretation of substructural logics
  • chapter Computational complexity and induction for partial computable functions in type theory
  • chapter Computability theory: structure or algorithms
  • chapter 3 processes in natural language interpretation.