 | 2011 |
|---|
| 11 |       | Benno van den Berg,
Ieke Moerdijk:
Aspects of predicative algebraic set theory, II: Realizability.
Theor. Comput. Sci. 412(20): 1916-1940 (2011) |
| 2008 |
|---|
| 10 | | Benno van den Berg,
Ieke Moerdijk:
Aspects of predicative algebraic set theory I: Exact completion.
Ann. Pure Appl. Logic 156(1): 123-159 (2008) |
| 2002 |
|---|
| 9 | | Ieke Moerdijk,
Erik Palmgren:
Type theories, toposes and constructive set theory: predicative aspects of AST.
Ann. Pure Appl. Logic 114(1-3): 155-201 (2002) |
| 2000 |
|---|
| 8 | | Ieke Moerdijk,
Erik Palmgren:
Wellfounded trees in categories.
Ann. Pure Appl. Logic 104(1-3): 189-218 (2000) |
| 1999 |
|---|
| 7 | | Carsten Butz,
Ieke Moerdijk:
An Elementary Definability Theorem for First Order Logic.
J. Symb. Log. 64(3): 1028-1036 (1999) |
| 1997 |
|---|
| 6 | | Ieke Moerdijk,
Erik Palmgren:
Minimal Models of Heyting Arithmetic.
J. Symb. Log. 62(4): 1448-1460 (1997) |
| 1995 |
|---|
| 5 | | Ieke Moerdijk:
A Model for Intuitionistic Non-Standard Arithmetic.
Ann. Pure Appl. Logic 73(1): 37-51 (1995) |
| 4 | | Raymond Hoofman,
Ieke Moerdijk:
A Remark on the Theory of Semi-Functors.
Mathematical Structures in Computer Science 5(1): 1-8 (1995) |
| 1994 |
|---|
| 3 | | André Joyal,
Ieke Moerdijk:
A Completeness Theorem for Open Maps.
Ann. Pure Appl. Logic 70(1): 51-86 (1994) |
| 1984 |
|---|
| 2 |  | Ieke Moerdijk:
Heine-Borel Does not Imply the Fan Theorem.
J. Symb. Log. 49(2): 514-519 (1984) |
| 1 | | Gerrit van Der Hoeven,
Ieke Moerdijk:
On Choice Sequences Determined by Spreads.
J. Symb. Log. 49(3): 908-916 (1984) |
Data released under the ODC-BY 1.0 license — See also our legal information page