Erik Palmgren

Orcid: 0000-0001-9830-1036

Affiliations:
  • Stockholm University, Sweden
  • Uppsala University, Sweden (former)


According to our database1, Erik Palmgren authored at least 55 papers between 1990 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
From type theory to setoids and back.
Math. Struct. Comput. Sci., November, 2022

2020
Exact Completion and Constructive Theories of Sets.
J. Symb. Log., 2020

2019
Preface to the special issue for The Fifth Workshop on Formal Topology.
J. Log. Anal., 2019

Categories with families and first-order logic with dependent sorts.
Ann. Pure Appl. Log., 2019

2018
A Constructive Examination of a Russell-Style Ramified Type Theory.
Bull. Symb. Log., 2018

2017
Constructions of categories of setoids from proof-irrelevant families.
Arch. Math. Log., 2017

On Equality of Objects in Categories in Constructive Type Theory.
Proceedings of the 23rd International Conference on Types for Proofs and Programs, 2017

2016
A constructive examination of rectifiability.
J. Log. Anal., 2016

2015
Introduction - from type theory and homotopy theory to univalent foundations.
Math. Struct. Comput. Sci., 2015

2014
Formal continuity implies uniform continuity near compact images on metric spaces.
Math. Log. Q., 2014

2013
A generalized cut characterization of the fullness axiom in CZF.
Log. J. IGPL, 2013

2012
Constructivist Versus Structuralist Foundations.
Proceedings of the Epistemology versus Ontology, 2012

Introduction: The philosophy of logical consequence and inference.
Synth., 2012

A note on Brouwer's weak continuity principle and the transfer principle in nonstandard analysis.
J. Log. Anal., 2012

Double sequences, almost Cauchyness and BD-N.
Log. J. IGPL, 2012

Constructivist and structuralist foundations: Bishop's and Lawvere's theories of sets.
Ann. Pure Appl. Log., 2012

A predicative completion of a uniform space.
Ann. Pure Appl. Log., 2012

Proof-relevance of families of setoids and identity in type theory.
Arch. Math. Log., 2012

2011
Metric complements of overt closed sets.
Math. Log. Q., 2011

2010
Open sublocales of localic completions.
J. Log. Anal., 2010

2008
Resolution of the uniform lower bound problem in constructive analysis.
Math. Log. Q., 2008

2007
Partial Horn logic and cartesian categories.
Ann. Pure Appl. Log., 2007

2006
Binary Refinement Implies Discrete Exponentiation.
Stud Logica, 2006

Regular universes and formal spaces.
Ann. Pure Appl. Log., 2006

Maximal and partial points in formal spaces.
Ann. Pure Appl. Log., 2006

Quotient topologies in constructive set theory and type theory.
Ann. Pure Appl. Log., 2006

2005
Internalising modified realisability in constructive type theory.
Log. Methods Comput. Sci., 2005

Quotient Spaces and Coequalisers in Formal Topology.
J. Univers. Comput. Sci., 2005

Constructive completions of ordered sets, groups and fields.
Ann. Pure Appl. Log., 2005

Coequalisers of formal topology.
Proceedings of the Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005

Continuity on the real line and in formal spaces.
Proceedings of the From sets and types to topology and analysis, 2005

2004
A categorical version of the Brouwer-Heyting-Kolmogorov interpretation.
Math. Struct. Comput. Sci., 2004

2002
An Intuitionistic Axiomatisation of Real Closed Fields.
Math. Log. Q., 2002

Type theories, toposes and constructive set theory: predicative aspects of AST.
Ann. Pure Appl. Log., 2002

Metric Boolean algebras and constructive measure theory.
Arch. Math. Log., 2002

2000
An Effective Conservation Result for Nonstandard Arithmetic.
Math. Log. Q., 2000

Wellfounded trees in categories.
Ann. Pure Appl. Log., 2000

Intuitionistic choice and classical logic.
Arch. Math. Log., 2000

1999
Hyperfinite Type Structures.
J. Symb. Log., 1999

1998
Developments in constructive nonstandard analysis.
Bull. Symb. Log., 1998

Inaccessibility in Constructive Set Theory and Type Theory.
Ann. Pure Appl. Log., 1998

1997
Constructive Sheaf Semantics.
Math. Log. Q., 1997

A Logical Presentation of the Continuous Functionals.
J. Symb. Log., 1997

Minimal Models of Heyting Arithmetic.
J. Symb. Log., 1997

A Sheaf-Theoretic Foundation for Nonstandard Analysis.
Ann. Pure Appl. Log., 1997

1995
The Friedman-Translation for Martin-Löf's Type Theory.
Math. Log. Q., 1995

A Constructive Approach to Nonstandard Analysis.
Ann. Pure Appl. Log., 1995

Logically Presented Domains
Proceedings of the Proceedings, 1995

1993
An Information System Interpretation of Martin-Löf's Partial Type Theory with Universes
Inf. Comput., September, 1993

A Note on Mathematics of infinity.
J. Symb. Log., 1993

Denotational Semantics of Constraint Logic Programming - A Nonstandard Approach.
Proceedings of the Constraint Programming, 1993

1992
Remarks on Martin-Löf's Partial Type Theory.
BIT, 1992

Type-theoretic interpretation of iterated, strictly positive inductive definitions.
Arch. Math. Log., 1992

1991
A Construction of Type: Type in Martin-Löf's Partial Type Theory with One Universe.
J. Symb. Log., 1991

1990
Domain Interpretations of Martin-Löf's Partial Type Theory.
Ann. Pure Appl. Log., 1990


  Loading...