Search the dblp DataBase

Publications of Author

1. André Joyal, Ieke Moerdijk
   A Completeness Theorem for Open Maps. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1994, v:70, n:1, pp:51-86 [Journal]
   
2. Ieke Moerdijk
   A Model for Intuitionistic Non-Standard Arithmetic. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1995, v:73, n:1, pp:37-51 [Journal]
   
3. Ieke Moerdijk, Erik Palmgren
   Wellfounded trees in categories. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:189-218 [Journal]
   
4. Ieke Moerdijk, Erik Palmgren
   Type theories, toposes and constructive set theory: predicative aspects of AST. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2002, v:114, n:1-3, pp:155-201 [Journal]
   
5. Carsten Butz, Ieke Moerdijk
   An Elementary Definability Theorem for First Order Logic. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1999, v:64, n:3, pp:1028-1036 [Journal]
   
6. Gerrit van Der Hoeven, Ieke Moerdijk
   On Choice Sequences Determined by Spreads. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1984, v:49, n:3, pp:908-916 [Journal]
   
7. Ieke Moerdijk
   Heine-Borel Does not Imply the Fan Theorem. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1984, v:49, n:2, pp:514-519 [Journal]
   
8. Ieke Moerdijk, Erik Palmgren
   Minimal Models of Heyting Arithmetic. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1997, v:62, n:4, pp:1448-1460 [Journal]
   
9. Raymond Hoofman, Ieke Moerdijk
   A Remark on the Theory of Semi-Functors. [Citation Graph (0, 0)][DBLP]
   Mathematical Structures in Computer Science, 1995, v:5, n:1, pp:1-8 [Journal]
   
10. 
    Aspects of predicative algebraic set theory I: Exact completion. [Citation Graph (, )][DBLP]