↓ Skip to main content
What is this page? Embed badge

Proof Theory in Computer Science

Overview of attention for book
Cover of 'Proof Theory in Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Linear Ramified Higher Type Recursion and Parallel Complexity
  3. Altmetric Badge
    Chapter 2 Reflective λ-Calculus
  4. Altmetric Badge
    Chapter 3 A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity
  5. Altmetric Badge
    Chapter 4 Comparing the Complexity of Cut-Elimination Methods
  6. Altmetric Badge
    Chapter 5 Program Extraction from Gentzen’s Proof of Transfinite Induction up to ε0
  7. Altmetric Badge
    Chapter 6 Coherent Bicartesian and Sesquicartesian Categories
  8. Altmetric Badge
    Chapter 7 Indexed Induction-Recursion
  9. Altmetric Badge
    Chapter 8 Modeling Meta-logical Features in a Calculus with Frozen Variables
  10. Altmetric Badge
    Chapter 9 Proof Theory and Post-turing Analysis
  11. Altmetric Badge
    Chapter 10 Interpolation for Natural Deduction with Generalized Eliminations
  12. Altmetric Badge
    Chapter 11 Implicit Characterizations of Pspace
  13. Altmetric Badge
    Chapter 12 Iterate logic
  14. Altmetric Badge
    Chapter 13 Constructive Foundations for Featherweight Java
Attention for Chapter 4: Comparing the Complexity of Cut-Elimination Methods
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
3 Mendeley
Summary Dimensions citations
So far, Dimensions has found 2 publications that cite this research output.

2

The most recent citing publications are shown below. View all 2 publications that cite this research output on Dimensions.

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.