|
7
|
1996], Computation on abstract data types. The extensional approach, with an application to streams
– Solomon Feferman, C. Kleene
|
|
3
|
Things that can and things that can't be done in PRA
– Ulrich Kohlenbach
- 1998
|
|
|
Special Issue Dialectica (50th anniversary of Gödel’s Dialectica paper) Table of Contents 1. Introduction (Thomas Strahm)
– Lieber Herr Bernays
|
|
1
|
A most artistic package of a jumble of ideas
– Fernando Ferreira
|
|
8
|
Foundational and mathematical uses of higher types
– Ulrich Kohlenbach
- 1999
|
|
9
|
Number theory and elementary arithmetic
– Jeremy Avigad
- 2003
|
|
8
|
Does Mathematics Need New Axioms?
– Solomon Feferman
- 1999
|
|
1
|
Injecting uniformities into Peano arithmetic
– Fernando Ferreira
|
|
|
PROOF INTERPRETATIONS AND MAJORIZABILITY
– Fernando Ferreira
|
|
1
|
On the strength of some semi-constructive theories
– Solomon Feferman
- 2009
|
|
6
|
Functional interpretation and inductive definitions
– Jeremy Avigad, Henry Towsner
|
|
|
Automata and Formal Languages
– Dominique Perrin
- 2003
|
|
|
Yin and Yang
– In Computer Science
|
|
23
|
Prod Reference Manual
– Kimmo Varpaaniemi, Kimmo Varpaaniemi, Jaakko Halme, Jaakko Halme, Kari Hiekkanen, Kari Hiekkanen, Tino Pyssysalo, Tino Pyssysalo
- 1995
|
|
4
|
Type Inference for First-Class Messages with Feature Constraints
– Martin Müller, Susumu Nishimura
- 1998
|
|
2
|
Computational Complexity Theory
– Michael Loui
- 1996
|
|
2
|
Topological (Bi-)Simulation
– P.J.L. Cuijpers, M.A. Reniers
- 2002
|
|
5
|
Quasi-delay-insensitive circuits are Turing-complete. Invited article
– Rajit Manohar, Alain J. Martin
- 1996
|
|
1
|
Lower Bounds for (MOD p - MOD m) Circuits
– Vince Grolmusz, Gabor Tardos
- 1998
|
