| 2008 |
| 15 | EE | Peter Aczel:
The Relation Reflection Scheme.
Math. Log. Q. 54(1): 5-11 (2008) |
| 2006 |
| 14 | EE | Peter Aczel:
Aspects of general topology in constructive set theory.
Ann. Pure Appl. Logic 137(1-3): 3-29 (2006) |
| 13 | EE | Peter Aczel,
Laura Crosilla,
Hajime Ishihara,
Erik Palmgren,
Peter Schuster:
Binary Refinement Implies Discrete Exponentiation.
Studia Logica 84(3): 361-368 (2006) |
| 2003 |
| 12 | EE | Peter Aczel,
Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Infinite trees and completely iterative theories: a coalgebraic view.
Theor. Comput. Sci. 300(1-3): 1-45 (2003) |
| 2001 |
| 11 | EE | Peter Aczel,
Jirí Adámek,
Jiri Velebil:
A Coalgebraic View of Infinite Trees and Iteration.
Electr. Notes Theor. Comput. Sci. 44(1): (2001) |
| 10 | | Peter Aczel:
The Russell-Prawitz modality.
Mathematical Structures in Computer Science 11(4): 541-554 (2001) |
| 2000 |
| 9 | EE | Peter Aczel:
Algebras and Coalgebras.
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction 2000: 79-88 |
| 8 | EE | Peter Aczel,
Nicola Gambino:
Collection Principles in Dependent Type Theory.
TYPES 2000: 1-23 |
| 1998 |
| 7 | EE | Peter Aczel:
On Relating Type Theories and Set Theories.
TYPES 1998: 1-18 |
| 1993 |
| 6 | | Peter Aczel:
Final Universes of Processes.
MFPS 1993: 1-28 |
| 1991 |
| 5 | | Peter Aczel:
Term Declaration Logic and Generalised Composita
LICS 1991: 22-30 |
| 1989 |
| 4 | | Peter Aczel,
Nax Paul Mendler:
A Final Coalgebra Theorem.
Category Theory and Computer Science 1989: 357-365 |
| 1988 |
| 3 | | Paul F. Mendler,
Peter Aczel:
The notion of a Framework and a framework for LTC
LICS 1988: 392-399 |
| 1986 |
| 2 | | Peter Aczel,
Jeff B. Paris,
A. J. Wilkie,
George M. Wilmers,
C. E. M. Yates:
European Summer Meeting of the Association for Symbolic Logic: Manchester, England, 1984.
J. Symb. Log. 51(2): 480-502 (1986) |
| 1972 |
| 1 | | Peter Aczel:
Describing Ordinals Using Functionals of Transfinite Type.
J. Symb. Log. 37(1): 35-47 (1972) |