Hostname: page-component-6766d58669-bp2c4 Total loading time: 0 Render date: 2026-05-18T04:04:10.174Z Has data issue: false hasContentIssue false

ERRATUM TO: CONNECTIVITY AND PURITY FOR LOGARITHMIC MOTIVES

Published online by Cambridge University Press:  04 April 2022

Federico Binda
Affiliation:
Dipartimento di Matematica “Federigo Enriques”, Università degli Studi di Milano Via Cesare Saldini 50, 20133 Milano, Italy (federico.binda@unimi.it)
Alberto Merici
Affiliation:
Department of Mathematics, University of Oslo, Niels Henrik Abels hus, Moltke Moes vei 35, 0851 Oslo, Norway (allbertm@math.uio.no)
Rights & Permissions [Opens in a new window]

Abstract

Information

Type
Correction
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2022. Published by Cambridge University Press