 | 2005 |
|---|
| 14 |       | Wilfried Buchholz,
Reinhard Kahle:
Preface.
Ann. Pure Appl. Logic 133(1-3): 1- (2005) |
| 13 | | Wilfried Buchholz:
A term calculus for (co-)recursive definitions on streamlike data structures.
Ann. Pure Appl. Logic 136(1-2): 75-90 (2005) |
| 2002 |
|---|
| 12 |  | Ulrich Berger,
Wilfried Buchholz,
Helmut Schwichtenberg:
Refined program extraction form classical proofs.
Ann. Pure Appl. Logic 114(1-3): 3-25 (2002) |
| 2001 |
|---|
| 11 | | Wilfried Buchholz:
Explaining the Gentzen-Takeuti reduction steps: a second-order system.
Arch. Math. Log. 40(4): 255-272 (2001) |
| 10 | | Wilfried Buchholz:
Finitary Treatment of Operator Controlled Derivations.
Math. Log. Q. 47(3): 363-396 (2001) |
| 1998 |
|---|
| 9 | | Wilfried Buchholz:
A Note on SLDNF-Resolution.
J. Log. Comput. 8(2): 159-167 (1998) |
| 1997 |
|---|
| 8 | | Wilfried Buchholz:
Explaining Gentzen's Consistency Proof within Infinitary Proof Theory.
Kurt Gödel Colloquium 1997: 4-17 |
| 7 | | Wilfried Buchholz:
An intuitionistic fixed point theory.
Arch. Math. Log. 37(1): 21-27 (1997) |
| 1995 |
|---|
| 6 | | Wilfried Buchholz:
Proof-Theoretic Analysis of Termination Proofs.
Ann. Pure Appl. Logic 75(1-2): 57-65 (1995) |
| 1994 |
|---|
| 5 | | Adam Cichon,
Wilfried Buchholz,
Andreas Weiermann:
A Uniform Approach to Fundamental Sequences and Hierarchies.
Math. Log. Q. 40: 273-286 (1994) |
| 1978 |
|---|
| 4 | | Wilfried Buchholz,
Wolfram Pohlers:
Provable Wellorderings of Formal Theories for Transfinitely Iterated Inductive Definitions.
J. Symb. Log. 43(1): 118-125 (1978) |
| 1959 |
|---|
| 3 | | Frederick P. Brooks Jr.,
Gerrit A. Blaauw,
Wilfried Buchholz:
Processing data in bits and pieces.
IFIP Congress 1959: 375-381 |
| 2 | | Wilfried Buchholz:
Fingers or Fists? (The Choice of Decimal or Binary Representation).
Commun. ACM 2(12): 3-11 (1959) |
| 1954 |
|---|
| 1 | | Charles J. Bashe,
Wilfried Buchholz,
Nathaniel Rochester:
The IBM Type 702, An Electronic Data Processing Machine for Business
J. ACM 1(4): 149-169 (1954) |
