Peter Aczel

Affiliations:
  • University of Manchester, UK


According to our database1, Peter Aczel authored at least 22 papers between 1972 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2015
Generalized geometric theories and set-generated classes.
Math. Struct. Comput. Sci., 2015

2013
Are There Enough Injective Sets?
Stud Logica, 2013

Rudimentary and arithmetical constructive set theory.
Ann. Pure Appl. Log., 2013

2010
On the T<sub>1</sub> axiom and other separation properties in constructive point-free and point-set topology.
Ann. Pure Appl. Log., 2010

2008
The Relation Reflection Scheme.
Math. Log. Q., 2008

2006
Binary Refinement Implies Discrete Exponentiation.
Stud Logica, 2006

The generalised type-theoretic interpretation of constructive set theory.
J. Symb. Log., 2006

Aspects of general topology in constructive set theory.
Ann. Pure Appl. Log., 2006

2005
Separation Properties in Constructive Topology.
Proceedings of the From sets and types to topology and analysis, 2005

2003
Infinite trees and completely iterative theories: a coalgebraic view.
Theor. Comput. Sci., 2003

2001
The Russell-Prawitz modality.
Math. Struct. Comput. Sci., 2001

A Coalgebraic View of Infinite Trees and Iteration.
Proceedings of the Coalgebraic Methods in Computer Science, 2001

2000
Collection Principles in Dependent Type Theory.
Proceedings of the Types for Proofs and Programs, International Workshop, 2000

Algebras and Coalgebras.
Proceedings of the Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, 2000

1998
On Relating Type Theories and Set Theories.
Proceedings of the Types for Proofs and Programs, 1998

1993
Final Universes of Processes.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1991
Term Declaration Logic and Generalised Composita
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1989
A Final Coalgebra Theorem.
Proceedings of the Category Theory and Computer Science, 1989

1988
The notion of a Framework and a framework for LTC
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

Non-well-founded sets.
CSLI lecture notes series 14, CSLI, ISBN: 978-0-937073-21-6, 1988

1986
European Summer Meeting of the Association for Symbolic Logic: Manchester, England, 1984.
J. Symb. Log., 1986

1972
Describing Ordinals Using Functionals of Transfinite Type.
J. Symb. Log., 1972


  Loading...