Prof Peter Aczel - publications

2008

• ACZEL, Peter. A constructive version of the Lusin Separation Theorem. In: S. Lindstrom, E. Palmgren, K. Segerberg, V. Stoltenberg-Hansen, ed. Logicism, Intuitionism and Formalism - What has become of them. 2008: eScholarID:3a121
• Aczel P. The Relation Reflection Scheme. Math. Log. Q. 2008; 54(1): 5-11. eScholarID:1h1 | DOI:10.1002/malq.200710035

2006

• Peter Aczel, Laura Crosilla, Hajime Ishihara, Erik Palmgren, Peter Schuster. Binary Refinement Implies Discrete Exponentiation. Studia Logica. 2006 December; 84: 361-368. eScholarID:1a6030
• ACZEL PH; GAMBINO N. The generalised type-theoretic interpretation of constructive set theory. Journal of Symbolic Logic. 2006 January; 71(1): 67-103. eScholarID:1a10325
• Aczel, P. The relation reflection scheme. Workshop on Trends in Constructive Mathematics in Honor of the 60th Birthday of Douglas Bridges. Wiley-V C H Verlag Gmbh: 2006: 5-11. eScholarID:2f218 | DOI:10.1002/malq.200710035
• Aczel P. Aspects of general topology in constructive set theory. Ann. Pure Appl. Logic. 2006; 137(1-3): 3-29. eScholarID:1h2 | DOI:10.1016/j.apal.2005.05.016

2005

• ACZEL, Peter and FOX, Chris. Separation properties in Constructive Topology. In: L. Crosilla, P. Schuster, ed. From Sets and Types to Topology and Analysis. Oxford University Press.2005: 176-192. eScholarID:3a123

2003

• ACZEL PH; ADAMEK J; MILIUS S; VELEBEL J. Infinite trees and completely iterative theories: a coalgebraic view. Theoretical Computer Science. 2003 April; 300(1-3): 1-45. eScholarID:1a10323 | DOI:10.1016/S0304-3975(02)00728-4

2002

• P.G.H. Aczel, J. Adamek and J. Velebel. A coalgebraic view of infinite trees. Electronic Notes in Theoretical Computer Science. 2002; 44: 79-88. eScholarID:1a2125
• ACZEL, Peter and Gambino, Nicola. Collection Principles in Dependent Type Theory. Types00. 2002: 1-23. eScholarID:2a678

2001

• ACZEL PH. The Russell-Prawitz Modality. Mathematical Structures in Computer Science. 2001 July; 11: 541-554. eScholarID:1a10326 | DOI:10.1017/S0960129501003309
• Aczel P, Adámek J, Velebil J. A Coalgebraic View of Infinite Trees and Iteration. Electr. Notes Theor. Comput. Sci. 2001; 44(1): eScholarID:1h5
• Aczel P. The Russell-Prawitz modality. Mathematical Structures in Computer Science. 2001; 11(4): 541-554. eScholarID:1h6

2000

• Aczel, Peter. Algebras and Coalgebras. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. Springer: 2000: 79-88. eScholarID:2h1
• Aczel, Peter, and Nicola Gambino. Collection Principles in Dependent Type Theory. TYPES. Springer: 2000: 1-23. eScholarID:2h2

1998

• Aczel, Peter. On Relating Type Theories and Set Theories. TYPES. Springer: 1998: 1-18. eScholarID:2h3

1993

• Aczel, Peter. Final Universes of Processes. MFPS. Springer: 1993: 1-28. eScholarID:2h4

1991

• Aczel, Peter. Term Declaration Logic and Generalised Composita. LICS. IEEE Computer Society: 1991: 22-30. eScholarID:2h5

1989

• Aczel, Peter, and Nax Paul Mendler. A Final Coalgebra Theorem. Category Theory and Computer Science. Springer: 1989: 357-365. eScholarID:2h6

1988

• Mendler, Paul F, and Peter Aczel. The notion of a Framework and a framework for LTC. LICS. IEEE Computer Society: 1988: 392-399. eScholarID:2h7

1986

• Aczel P, Paris J, Wilkie A, Wilmers G, Yates C. European Summer Meeting of the Association for Symbolic Logic: Manchester, England, 1984. J. Symb. Log. 1986; 51(2): 480-502. eScholarID:1h7

1972

• Aczel P. Describing Ordinals Using Functionals of Transfinite Type. J. Symb. Log. 1972; 37(1): 35-47. eScholarID:1h8