Benno van den Berg

Orcid: 0000-0002-0469-0788

Affiliations:
  • University of Amsterdam, The Netherlands


According to our database1, Benno van den Berg authored at least 29 papers between 2005 and 2024.

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

2024
Conservativity of Type Theory over Higher-Order Arithmetic.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2022
Converse extensionality and apartness.
Log. Methods Comput. Sci., 2022

2021
Quadratic type checking for objective type theory.
CoRR, 2021

2020
Effective Kan fibrations in simplicial sets.
CoRR, 2020

Univalent polymorphism.
Ann. Pure Appl. Log., 2020

2019
A homotopy-theoretic model of function extensionality in the effective topos.
Math. Struct. Comput. Sci., 2019

Reverse Mathematics and parameter-free Transfer.
Ann. Pure Appl. Log., 2019

A Kuroda-style j-translation.
Arch. Math. Log., 2019

2018
Path Categories and Propositional Identity Types.
ACM Trans. Comput. Log., 2018

W-types in homotopy-type theory - CORRIGENDUM.
Math. Struct. Comput. Sci., 2018

2017
Nonstandard Functional Interpretations and Categorical Models.
Notre Dame J. Formal Log., 2017

A note on equality in finite-type arithmetic.
Math. Log. Q., 2017

The strength of countable saturation.
Arch. Math. Log., 2017

2015
W-types in homotopy type theory.
Math. Struct. Comput. Sci., 2015

2014
The axiom of multiple choice and models for constructive set theory.
J. Math. Log., 2014

2013
Are There Enough Injective Sets?
Stud Logica, 2013

Non-deterministic inductive definitions.
Arch. Math. Log., 2013

Erratum to: Noncommutativity as a Colimit.
Appl. Categorical Struct., 2013

2012
Topological and Simplicial Models of Identity Types.
ACM Trans. Comput. Log., 2012

Derived rules for predicative set theory: An application of sheaves.
Ann. Pure Appl. Log., 2012

A functional interpretation for nonstandard arithmetic.
Ann. Pure Appl. Log., 2012

Noncommutativity as a Colimit.
Appl. Categorical Struct., 2012

2011
Aspects of predicative algebraic set theory, II: Realizability.
Theor. Comput. Sci., 2011

No-go theorems for functorial localic spectra of noncommutative rings.
Proceedings of the Proceedings 8th International Workshop on Quantum Physics and Logic, 2011

2009
Three extensional models of type theory.
Math. Struct. Comput. Sci., 2009

2008
Aspects of predicative algebraic set theory I: Exact completion.
Ann. Pure Appl. Log., 2008

2007
Models of non-well-founded sets via an indexed final coalgebra theorem.
J. Symb. Log., 2007

Non-well-founded trees in categories.
Ann. Pure Appl. Log., 2007

2005
Inductive types and exact completion.
Ann. Pure Appl. Log., 2005


  Loading...