You have Guest access.
Log In
Reinhard Kahle, Peter Schroeder-Heister and Robert Stärk
Front matter
1-21
Linear Ramified Higher Type Recursion and Parallel Complexity
22-37
Reflective λ-Calculus
38-48
A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity
49-67
Comparing the Complexity of Cut-Elimination Methods
68-77
Program Extraction from Gentzen’s Proof of Transfinite Induction up to ε0
78-92
Coherent Bicartesian and Sesquicartesian Categories
93-113
Indexed Induction-Recursion
114-129
Modeling Meta-logical Features in a Calculus with Frozen Variables
130-152
Proof Theory and Post-turing Analysis
153-169
Interpolation for Natural Deduction with Generalized Eliminations
170-190
Implicit Characterizations of Pspace
191-201
Iterate logic
202-238
Constructive Foundations for Featherweight Java
Back matter
Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg and Sebastiaan A. Terwijn
Jesse Alt and Sergei Artemov
Matthias Baaz and Christian G. Fermüller
Matthias Baaz and Alexander Leitsch
Ulrich Berger
Kosta Došen and Zoran Petrić
Peter Dybjer and Anton Setzer
Birgit Elbl
Lew Gordeew
Ralph Matthes
Isabel Oitavem
Peter H. Schmitt
Thomas Studer
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info