default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErik Palmgren
Person information
- affiliation: Stockholm University, Sweden
- affiliation (former): Uppsala University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j49]Erik Palmgren
:
From type theory to setoids and back. Math. Struct. Comput. Sci. 32(10): 1283-1312 (2022)- 2020
- [j48]Jacopo Emmenegger, Erik Palmgren:
Exact Completion and Constructive Theories of Sets. J. Symb. Log. 85(2): 563-584 (2020)
2010 – 2019
- 2019
- [j47]Erik Palmgren:
Categories with families and first-order logic with dependent sorts. Ann. Pure Appl. Log. 170(12) (2019) - [j46]Thierry Coquand, Maria Emilia Maietti, Erik Palmgren:
Preface to the special issue for The Fifth Workshop on Formal Topology. J. Log. Anal. 11 (2019) - 2018
- [j45]Erik Palmgren:
A Constructive Examination of a Russell-Style Ramified Type Theory. Bull. Symb. Log. 24(1): 90-106 (2018) - 2017
- [j44]Erik Palmgren:
Constructions of categories of setoids from proof-irrelevant families. Arch. Math. Log. 56(1-2): 51-66 (2017) - [c3]Erik Palmgren:
On Equality of Objects in Categories in Constructive Type Theory. TYPES 2017: 7:1-7:7 - 2016
- [j43]Douglas S. Bridges, Matthew Hendtlass, Erik Palmgren:
A constructive examination of rectifiability. J. Log. Anal. 8 (2016) - 2015
- [j42]Steve Awodey, Nicola Gambino, Erik Palmgren:
Introduction - from type theory and homotopy theory to univalent foundations. Math. Struct. Comput. Sci. 25(5): 1005-1009 (2015) - 2014
- [j41]Erik Palmgren:
Formal continuity implies uniform continuity near compact images on metric spaces. Math. Log. Q. 60(1-2): 66-69 (2014) - 2013
- [j40]Laura Crosilla, Erik Palmgren, Peter Schuster:
A generalized cut characterization of the fullness axiom in CZF. Log. J. IGPL 21(1): 63-76 (2013) - 2012
- [j39]Erik Palmgren:
Proof-relevance of families of setoids and identity in type theory. Arch. Math. Log. 51(1-2): 35-47 (2012) - [j38]Josef Berger, Hajime Ishihara, Erik Palmgren, Peter Schuster:
A predicative completion of a uniform space. Ann. Pure Appl. Log. 163(8): 975-980 (2012) - [j37]Erik Palmgren:
Constructivist and structuralist foundations: Bishop's and Lawvere's theories of sets. Ann. Pure Appl. Log. 163(10): 1384-1399 (2012) - [j36]Josef Berger, Douglas S. Bridges, Erik Palmgren:
Double sequences, almost Cauchyness and BD-N. Log. J. IGPL 20(1): 349-354 (2012) - [j35]Erik Palmgren:
A note on Brouwer's weak continuity principle and the transfer principle in nonstandard analysis. J. Log. Anal. 4 (2012) - [j34]Sten Lindström, Erik Palmgren, Dag Westerståhl:
Introduction: The philosophy of logical consequence and inference. Synth. 187(3): 817-820 (2012) - [p2]Erik Palmgren:
Constructivist Versus Structuralist Foundations. Epistemology versus Ontology 2012: 265-279 - [e1]Peter Dybjer, Sten Lindström, Erik Palmgren, Göran Sundholm:
Epistemology versus Ontology - Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf. Logic, Epistemology, and the Unity of Science 27, Springer 2012, ISBN 978-94-007-4434-9 [contents] - 2011
- [j33]Thierry Coquand, Erik Palmgren, Bas Spitters:
Metric complements of overt closed sets. Math. Log. Q. 57(4): 373-378 (2011) - 2010
- [j32]Erik Palmgren:
Open sublocales of localic completions. J. Log. Anal. 2 (2010)
2000 – 2009
- 2008
- [j31]Erik Palmgren:
Resolution of the uniform lower bound problem in constructive analysis. Math. Log. Q. 54(1): 65-69 (2008) - 2007
- [j30]Erik Palmgren, Steven J. Vickers:
Partial Horn logic and cartesian categories. Ann. Pure Appl. Log. 145(3): 314-353 (2007) - 2006
- [j29]Erik Palmgren:
Maximal and partial points in formal spaces. Ann. Pure Appl. Log. 137(1-3): 291-298 (2006) - [j28]Erik Palmgren:
Regular universes and formal spaces. Ann. Pure Appl. Log. 137(1-3): 299-316 (2006) - [j27]Hajime Ishihara, Erik Palmgren:
Quotient topologies in constructive set theory and type theory. Ann. Pure Appl. Log. 141(1-2): 257-265 (2006) - [j26]Peter Aczel, Laura Crosilla, Hajime Ishihara, Erik Palmgren, Peter Schuster:
Binary Refinement Implies Discrete Exponentiation. Stud Logica 84(3): 361-368 (2006) - 2005
- [j25]Erik Palmgren:
Constructive completions of ordered sets, groups and fields. Ann. Pure Appl. Log. 135(1-3): 243-262 (2005) - [j24]Erik Palmgren:
Quotient Spaces and Coequalisers in Formal Topology. J. Univers. Comput. Sci. 11(12): 1996-2007 (2005) - [j23]Erik Palmgren:
Internalising modified realisability in constructive type theory. Log. Methods Comput. Sci. 1(2) (2005) - [p1]Erik Palmgren:
Continuity on the real line and in formal spaces. From sets and types to topology and analysis 2005 - [i2]Erik Palmgren:
Coequalisers of formal topology. Mathematics, Algorithms, Proofs 2005 - [i1]Erik Palmgren:
Internalising modified realisability in constructive type theory. CoRR abs/math/0505418 (2005) - 2004
- [j22]Erik Palmgren:
A categorical version of the Brouwer-Heyting-Kolmogorov interpretation. Math. Struct. Comput. Sci. 14(1): 57-72 (2004) - 2002
- [j21]Thierry Coquand, Erik Palmgren:
Metric Boolean algebras and constructive measure theory. Arch. Math. Log. 41(7): 687-704 (2002) - [j20]Ieke Moerdijk, Erik Palmgren:
Type theories, toposes and constructive set theory: predicative aspects of AST. Ann. Pure Appl. Log. 114(1-3): 155-201 (2002) - [j19]Erik Palmgren:
An Intuitionistic Axiomatisation of Real Closed Fields. Math. Log. Q. 48(2): 297-299 (2002) - 2000
- [j18]Thierry Coquand, Erik Palmgren:
Intuitionistic choice and classical logic. Arch. Math. Log. 39(1): 53-74 (2000) - [j17]Ieke Moerdijk, Erik Palmgren:
Wellfounded trees in categories. Ann. Pure Appl. Log. 104(1-3): 189-218 (2000) - [j16]Erik Palmgren:
An Effective Conservation Result for Nonstandard Arithmetic. Math. Log. Q. 46(1): 17-23 (2000)
1990 – 1999
- 1999
- [j15]Dag Normann, Erik Palmgren, Viggo Stoltenberg-Hansen:
Hyperfinite Type Structures. J. Symb. Log. 64(3): 1216-1242 (1999) - 1998
- [j14]Michael Rathjen, Edward R. Griffor, Erik Palmgren:
Inaccessibility in Constructive Set Theory and Type Theory. Ann. Pure Appl. Log. 94(1-3): 181-200 (1998) - [j13]Erik Palmgren:
Developments in constructive nonstandard analysis. Bull. Symb. Log. 4(3): 233-272 (1998) - 1997
- [j12]Erik Palmgren:
A Sheaf-Theoretic Foundation for Nonstandard Analysis. Ann. Pure Appl. Log. 85(1): 69-86 (1997) - [j11]Erik Palmgren, Viggo Stoltenberg-Hansen:
A Logical Presentation of the Continuous Functionals. J. Symb. Log. 62(3): 1021-1034 (1997) - [j10]Ieke Moerdijk, Erik Palmgren:
Minimal Models of Heyting Arithmetic. J. Symb. Log. 62(4): 1448-1460 (1997) - [j9]Erik Palmgren:
Constructive Sheaf Semantics. Math. Log. Q. 43: 321-327 (1997) - 1995
- [j8]Erik Palmgren:
A Constructive Approach to Nonstandard Analysis. Ann. Pure Appl. Log. 73(3): 297-325 (1995) - [j7]Erik Palmgren:
The Friedman-Translation for Martin-Löf's Type Theory. Math. Log. Q. 41: 314-326 (1995) - [c2]Erik Palmgren, Viggo Stoltenberg-Hansen:
Logically Presented Domains. LICS 1995: 455-463 - 1993
- [j6]Erik Palmgren:
An Information System Interpretation of Martin-Löf's Partial Type Theory with Universes. Inf. Comput. 106(1): 26-60 (1993) - [j5]Erik Palmgren:
A Note on Mathematics of infinity. J. Symb. Log. 58(4): 1195-1200 (1993) - [c1]Erik Palmgren:
Denotational Semantics of Constraint Logic Programming - A Nonstandard Approach. NATO ASI CP 1993: 261-288 - 1992
- [j4]Erik Palmgren:
Type-theoretic interpretation of iterated, strictly positive inductive definitions. Arch. Math. Log. 32(2): 75-99 (1992) - [j3]Erik Palmgren, Viggo Stoltenberg-Hansen:
Remarks on Martin-Löf's Partial Type Theory. BIT 32(1): 70-83 (1992) - 1991
- [j2]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
- [j1]Erik Palmgren, Viggo Stoltenberg-Hansen:
Domain Interpretations of Martin-Löf's Partial Type Theory. Ann. Pure Appl. Log. 48(2): 135-196 (1990)
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 2025-01-20 22:52 CET 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:
