default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Aczel
Person information
- affiliation: University of Manchester, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j12]Peter Aczel, Hajime Ishihara, Takako Nemoto
, Yasushi Sangu:
Generalized geometric theories and set-generated classes. Math. Struct. Comput. Sci. 25(7): 1466-1483 (2015)- 2013
- [j11]Peter Aczel:
Rudimentary and arithmetical constructive set theory. Ann. Pure Appl. Log. 164(4): 396-415 (2013) - [j10]Peter Aczel, Benno van den Berg, Johan Georg Granström, Peter Schuster:
Are There Enough Injective Sets? Stud Logica 101(3): 467-482 (2013) - 2010
- [j9]Peter Aczel, Giovanni Curi:
On the T1 axiom and other separation properties in constructive point-free and point-set topology. Ann. Pure Appl. Log. 161(4): 560-569 (2010)
2000 – 2009
- 2008
- [j8]Peter Aczel:
The Relation Reflection Scheme. Math. Log. Q. 54(1): 5-11 (2008) - 2006
- [j7]Peter Aczel:
Aspects of general topology in constructive set theory. Ann. Pure Appl. Log. 137(1-3): 3-29 (2006) - [j6]Peter Aczel, Nicola Gambino:
The generalised type-theoretic interpretation of constructive set theory. J. Symb. Log. 71(1): 67-103 (2006) - [j5]Peter Aczel, Laura Crosilla, Hajime Ishihara, Erik Palmgren, Peter Schuster:
Binary Refinement Implies Discrete Exponentiation. Stud Logica 84(3): 361-368 (2006) - 2005
- [p1]Peter Aczel, Christopher Fox:
Separation Properties in Constructive Topology. From sets and types to topology and analysis 2005 - 2003
- [j4]Peter Aczel, Jirí Adámek, Stefan Milius, Jirí Velebil:
Infinite trees and completely iterative theories: a coalgebraic view. Theor. Comput. Sci. 300(1-3): 1-45 (2003) - 2001
- [j3]Peter Aczel:
The Russell-Prawitz modality. Math. Struct. Comput. Sci. 11(4): 541-554 (2001) - [c8]Peter Aczel, Jirí Adámek, Jirí Velebil:
A Coalgebraic View of Infinite Trees and Iteration. CMCS 2001: 1-26 - 2000
- [c7]Peter Aczel:
Algebras and Coalgebras. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction 2000: 79-88 - [c6]Peter Aczel, Nicola Gambino:
Collection Principles in Dependent Type Theory. TYPES 2000: 1-23
1990 – 1999
- 1998
- [c5]Peter Aczel:
On Relating Type Theories and Set Theories. TYPES 1998: 1-18 - 1993
- [c4]Peter Aczel:
Final Universes of Processes. MFPS 1993: 1-28 - 1991
- [c3]Peter Aczel:
Term Declaration Logic and Generalised Composita. LICS 1991: 22-30
1980 – 1989
- 1989
- [c2]Peter Aczel, Nax Paul Mendler:
A Final Coalgebra Theorem. Category Theory and Computer Science 1989: 357-365 - 1988
- [b1]Peter Aczel:
Non-well-founded sets. CSLI lecture notes series 14, CSLI 1988, ISBN 978-0-937073-21-6, pp. I-XX, 1-137 - [c1]Paul F. Mendler, Peter Aczel:
The notion of a Framework and a framework for LTC. LICS 1988: 392-399 - 1986
- [j2]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)
1970 – 1979
- 1972
- [j1]Peter Aczel:
Describing Ordinals Using Functionals of Transfinite Type. J. Symb. Log. 37(1): 35-47 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
