| 2007 |
|---|
| 30 | EE | Erik Palmgren,
Steven J. Vickers:
Partial Horn logic and cartesian categories.
Ann. Pure Appl. Logic 145(3): 314-353 (2007) |
| 2006 |
|---|
| 29 | EE | Erik Palmgren:
Maximal and partial points in formal spaces.
Ann. Pure Appl. Logic 137(1-3): 291-298 (2006) |
| 28 | EE | Erik Palmgren:
Regular universes and formal spaces.
Ann. Pure Appl. Logic 137(1-3): 299-316 (2006) |
| 27 | EE | Hajime Ishihara,
Erik Palmgren:
Quotient topologies in constructive set theory and type theory.
Ann. Pure Appl. Logic 141(1-2): 257-265 (2006) |
| 26 | EE | Peter Aczel,
Laura Crosilla,
Hajime Ishihara,
Erik Palmgren,
Peter Schuster:
Binary Refinement Implies Discrete Exponentiation.
Studia Logica 84(3): 361-368 (2006) |
| 2005 |
|---|
| 25 | EE | Erik Palmgren:
Coequalisers of formal topology.
Mathematics, Algorithms, Proofs 2005 |
| 24 | EE | Erik Palmgren:
Constructive completions of ordered sets, groups and fields.
Ann. Pure Appl. Logic 135(1-3): 243-262 (2005) |
| 23 | EE | Erik Palmgren:
Internalising modified realisability in constructive type theory
CoRR abs/math/0505418: (2005) |
| 22 | EE | Erik Palmgren:
Quotient Spaces and Coequalisers in Formal Topology.
J. UCS 11(12): 1996-2007 (2005) |
| 21 | EE | Erik Palmgren:
Internalising modified realisability in constructive type theory.
Logical Methods in Computer Science 1(2): (2005) |
| 2004 |
|---|
| 20 | EE | Erik Palmgren:
A categorical version of the Brouwer-Heyting-Kolmogorov interpretation.
Mathematical Structures in Computer Science 14(1): 57-72 (2004) |
| 2002 |
|---|
| 19 | | 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) |
| 18 | EE | Erik Palmgren:
An Intuitionistic Axiomatisation of Real Closed Fields.
Math. Log. Q. 48(2): 297-299 (2002) |
| 2000 |
|---|
| 17 | | Ieke Moerdijk,
Erik Palmgren:
Wellfounded trees in categories.
Ann. Pure Appl. Logic 104(1-3): 189-218 (2000) |
| 16 | EE | Erik Palmgren:
An Effective Conservation Result for Nonstandard Arithmetic.
Math. Log. Q. 46(1): 17-23 (2000) |
| 1999 |
|---|
| 15 | | Dag Normann,
Erik Palmgren,
Viggo Stoltenberg-Hansen:
Hyperfinite Type Structures.
J. Symb. Log. 64(3): 1216-1242 (1999) |
| 1998 |
|---|
| 14 | | Michael Rathjen,
Edward R. Griffor,
Erik Palmgren:
Inaccessibility in Constructive Set Theory and Type Theory.
Ann. Pure Appl. Logic 94(1-3): 181-200 (1998) |
| 13 | EE | Erik Palmgren:
Developments in constructive nonstandard analysis.
Bulletin of Symbolic Logic 4(3): 233-272 (1998) |
| 1997 |
|---|
| 12 | | Erik Palmgren:
A Sheaf-Theoretic Foundation for Nonstandard Analysis.
Ann. Pure Appl. Logic 85(1): 69-86 (1997) |
| 11 | | Erik Palmgren,
Viggo Stoltenberg-Hansen:
A Logical Presentation of the Continuous Functionals.
J. Symb. Log. 62(3): 1021-1034 (1997) |
| 10 | | Ieke Moerdijk,
Erik Palmgren:
Minimal Models of Heyting Arithmetic.
J. Symb. Log. 62(4): 1448-1460 (1997) |
| 9 | | Erik Palmgren:
Constructive Sheaf Semantics.
Math. Log. Q. 43: 321-327 (1997) |
| 1995 |
|---|
| 8 | | Erik Palmgren,
Viggo Stoltenberg-Hansen:
Logically Presented Domains
LICS 1995: 455-463 |
| 7 | | Erik Palmgren:
A Constructive Approach to Nonstandard Analysis.
Ann. Pure Appl. Logic 73(3): 297-325 (1995) |
| 6 | | Erik Palmgren:
The Friedman-Translation for Martin-Löf's Type Theory.
Math. Log. Q. 41: 314-326 (1995) |
| 1993 |
|---|
| 5 | | Erik Palmgren:
An Information System Interpretation of Martin-L\"of's Partial Type Theory with Universes
Inf. Comput. 106(1): 26-60 (1993) |
| 4 | | Erik Palmgren:
A Note on Mathematics of infinity.
J. Symb. Log. 58(4): 1195-1200 (1993) |
| 1992 |
|---|
| 3 | | Erik Palmgren,
Viggo Stoltenberg-Hansen:
Remarks on Martin-Löf's Partial Type Theory.
BIT 32(1): 70-83 (1992) |
| 1991 |
|---|
| 2 | | Erik Palmgren:
A Construction of Type: Type in Martin-Löf's Partial Type Theory with One Universe.
J. Symb. Log. 56(3): 1012-1015 (1991) |
| 1990 |
|---|
| 1 | | Erik Palmgren,
Viggo Stoltenberg-Hansen:
Domain Interpretations of Martin-Löf's Partial Type Theory.
Ann. Pure Appl. Logic 48(2): 135-196 (1990) |
