14 found
Sort by:
Disambiguations:
Peter Aczel [14]P. Aczel [3]
  1. Peter Aczel, Benno van den Berg, Johan Granström & Peter Schuster (forthcoming). Are There Enough Injective Sets? Studia Logica.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Peter Aczel (2013). Rudimentary and Arithmetical Constructive Set Theory. Annals of Pure and Applied Logic 164 (4):396-415.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. Peter Aczel, Benno Berg, Johan Granström & Peter Schuster (2013). Are There Enough Injective Sets? Studia Logica 101 (3):467-482.
    The axiom of choice ensures precisely that, in ZFC, every set is projective: that is, a projective object in the category of sets. In constructive ZF (CZF) the existence of enough projective sets has been discussed as an additional axiom taken from the interpretation of CZF in Martin-Löf’s intuitionistic type theory. On the other hand, every non-empty set is injective in classical ZF, which argument fails to work in CZF. The aim of this paper is to shed some light on (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Peter Aczel & Giovanni Curi (2010). On the T1 Axiom and Other Separation Properties in Constructive Point-Free and Point-Set Topology. Annals of Pure and Applied Logic 161 (4):560-569.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  5. Peter Aczel (2008). The Relation Reflection Scheme. Mathematical Logic Quarterly 54 (1):5-11.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Peter Aczel (2006). Aspects of General Topology in Constructive Set Theory. Annals of Pure and Applied Logic 137 (1):3-29.
  7. Peter Aczel, Laura Crosilla, Hajime Ishihara, Erik Palmgren & Peter Schuster (2006). Binary Refinement Implies Discrete Exponentiation. Studia Logica 84 (3):361 - 368.
    Working in the weakening of constructive Zermelo-Fraenkel set theory in which the subset collection scheme is omitted, we show that the binary re.nement principle implies all the instances of the exponentiation axiom in which the basis is a discrete set. In particular binary re.nement implies that the class of detachable subsets of a set form a set. Binary re.nement was originally extracted from the fullness axiom, an equivalent of subset collection, as a principle that was su.cient to prove that the (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  8. Nicola Gambino & Peter Aczel (2006). The Generalised Type-Theoretic Interpretation of Constructive Set Theory. Journal of Symbolic Logic 71 (1):67 - 103.
    We present a generalisation of the type-theoretic interpretation of constructive set theory into Martin-Löf type theory. The original interpretation treated logic in Martin-Löf type theory via the propositions-as-types interpretation. The generalisation involves replacing Martin-Löf type theory with a new type theory in which logic is treated as primitive. The primitive treatment of logic in type theories allows us to study reinterpretations of logic, such as the double-negation translation.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. Peter Aczel, David Israel, Yosuhiro Katagiri & Stanley Peters (eds.) (1993). Situation Theory and its Applications Vol. Csli.
    Situation Theory and Its Applications, Vol. 1 . Robin Cooper, Kuniaki Mukai, and John Perry (Eds.). Lecture Notes No. 22. ...
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  10. Peter Aczel, Harold Simmons & S. S. Wainer (eds.) (1992). Proof Theory: A Selection of Papers From the Leeds Proof Theory Programme, 1990. Cambridge University Press.
    This work is derived from the SERC "Logic for IT" Summer School Conference on Proof Theory held at Leeds University. The contributions come from acknowledged experts and comprise expository and research articles which form an invaluable introduction to proof theory aimed at both mathematicians and computer scientists.
    Direct download  
     
    My bibliography  
     
    Export citation  
  11. P. Aczel, J. B. Paris, A. J. Wilkie, G. M. Wilmers & C. E. M. Yates (1986). European Summer Meeting of the Association for Symbolic Logic: Manchester, England, 1984. Journal of Symbolic Logic 51 (2):480-502.
  12. K. Kunen, A. Nerode, A. Prestel, P. Aczel, Hp Barendregt, E. Borger, Jn Crossley, E. Engeler, P. Hajek & Ba Kushner (1984). Managing Editors D. Van Dalen Y. Gurevich J. Hartmanis. Annals of Pure and Applied Logic 26:101.
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  13. P. Aczel (1980). Frege Structures and the Notions of Truth and Proposition. In. In J. Barwise, H. J. Keisler & K. Kunen (eds.), The Kleene Symposium. North-Holland.
    No categories
     
    My bibliography  
     
    Export citation  
  14. Peter Aczel (1972). Describing Ordinals Using Functionals of Transfinite Type. Journal of Symbolic Logic 37 (1):35-47.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation