|
535
|
Theory of Recursive Functions and Effective Computability
– Rogers
- 1967
|
|
334
|
Explicit substitutions
– Abadi, Cardelli, et al.
- 1991
|
|
191
|
Introduction to combinators and *-calculus
– Hindley, Seldin
- 1988
|
|
108
|
The intrinsic computational difficulty of functions
– Cobham
- 1965
|
|
92
|
Bounded Arithmetic. Bibliopolis
– Buss
- 1986
|
|
80
|
Subsystems of Second Order Arithmetic
– Simpson
- 1999
|
|
77
|
Functional interpretations of feasibly constructive arithmetic
– Cook, Urquhart
- 1993
|
|
71
|
A language and axioms for explicit mathematics
– Feferman
- 1975
|
|
59
|
Constructive theories of functions and classes
– Feferman
- 1979
|
|
55
|
Proof theory: Some applications of cut-elimination
– Schwichtenberg
- 1977
|
|
44
|
Foundations of constructive mathematics. Metamathematical studies, volume 6 of Ergebnisse der Mathematik und ihrer Grenzgebiete
– Beeson
- 1985
|
|
38
|
Systems of explicit mathematics with non-constructive µ-operator
– Feferman, ager, et al.
- 1993
|
|
37
|
Recursion-Theoretic Hierarchies
– Hinman
- 1978
|
|
35
|
Proof Theory: An Introduction
– Pohlers
- 1989
|
|
34
|
PX: A computational logic
– Hayashi, Nakano
- 1988
|
|
33
|
Hilbert's program relativized: proof-theoretical and foundational studies
– Feferman
- 1988
|
|
30
|
Characterizations of the basic feasible functions of finite type
– Cook, Kapron
- 1990
|
|
30
|
On a number-theoretic choice schema and its relation to induction, in Intuitionism and Proof Theory: proceedings of the summer conference at Buffalo N.Y
– Parsons
- 1968
|
|
26
|
Finitary inductively presented logics
– Feferman
- 1989
|
|
26
|
Polymorphic typed lambda-calculi in a type-free axiomatic framework
– Feferman
- 1990
|
|
25
|
Formal theories for transfinite iterations of generalized inductive definitions and some subsystems of analysis
– Feferman
- 1970
|
|
24
|
Logics for termination and correctness of functional programs
– Feferman
- 1992
|
|
22
|
Complexity theory of higher type functionals
– Seth
- 1994
|
|
20
|
Iterated inductive fixed-point theories: Application to Hancock’s conjecture
– Feferman
- 1982
|
|
15
|
Polynomial Time Computable Arithmetic and Conservative Extensions
– Ferreira
- 1988
|
|
12
|
Polynomial time computable arithmetic
– Ferreira
- 1990
|
|
12
|
A feasible theory for analysis
– Ferreira
- 1994
|
|
11
|
A theory of variable types. Revista Colombiana de Mat'ematicas
– Feferman
- 1985
|
|
11
|
Proof-theoretic equivalences between classical and constructive theories for analysis
– Feferman, Sieg
- 1981
|
|
11
|
Fixed points in Peano arithmetic with ordinals
– ager, G
- 1993
|
|
10
|
Proof Theory and Logical Complexitiy
– Girard
- 1987
|
|
10
|
Proof Theory
– utte, K
- 1977
|
|
8
|
The Lambda Calculus, revised ed
– Barendregt
- 1984
|
|
8
|
Systems of explicit mathematics with nonconstructive -operator and join. Annals of Pure and Applied Logic
– Gla, Strahm
- 1996
|
|
8
|
Eine beweistheoretische Untersuchung von (\Delta 2 -CA)+ (BI) und verwandter Systeme
– ager, G, et al.
- 1982
|
|
7
|
A conservation result concerning bounded theories and the collection axiom
– Buss
- 1987
|
|
7
|
Totality in applicative theories
– ager, G, et al.
- 1995
|
|
6
|
Beweistheorie von KPN. Archiv fur mathematische Logik und Grundlagenforschung 20
– ager, G
- 1980
|
|
6
|
order theories with ordinals and elementary comprehension
– ager, G, et al.
- 1995
|
|
5
|
A note on polynomial time computable arithmetic
– Buchholz, Sieg
- 1990
|
|
5
|
Asymmetric interpretation for bounded theories
– Cantini
- 1996
|
|
5
|
Logical Frameworks for Truth and Abstraction
– Cantini
- 1996
|
|
4
|
On the computational content of theories of operations with total application
– Cantini
- 1995
|
|
4
|
A note on a result of Buss concerning bounded theories and the collection scheme
– Ferreira
- 1995
|
|
4
|
A well-ordering proof for Feferman's theory T 0 . Archiv fur mathematische Logik und Grundlagenforschung 23
– ager, G
- 1983
|
|
4
|
Some theories with positive induction of ordinal strength '!0
– ager, G, et al.
- 1996
|
|
4
|
Herbrand analyses. Archive for
– Sieg
- 1991
|
|
3
|
Proof-theoretic aspects of self-referential truth
– Cantini
- 1995
|
|
3
|
Weyl Vindicated: "Das Kontinuum" 70 Years Later
– Feferman
- 1988
|
|
3
|
Iterated inductive definitions and \Sigma 2 -AC
– Friedman
- 1968
|
|
