Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-22T18:07:04.194Z Has data issue: false hasContentIssue false

Continuity and catastrophic risk – CORRIGENDUM

Published online by Cambridge University Press:  03 March 2023

H. Orri Stefánsson*
Affiliation:
Department of Philosophy, Stockholm University, Universitetsvägen 10 D, 114 18 Stockholm, Sweden; and Swedish Collegium for Advanced Study, Thunbergsvägen 2, 752 38 Uppsala, Sweden
*
Email: [email protected]. URL: www.orristefansson.is
Rights & Permissions [Opens in a new window]

Abstract

Type
Corrigendum
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 (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press

The author would like to correct some text in the article above:

Page 4, line 24:-

Assumption 1 (Downward trade-off). For any triple $O_{i-1}$ , $O_i$ , $O_{i+1} \in {\bf O}$ and for any $p \in (0, 1)$ , there is a $q \in (0,1)$ such that:

$$[O_{i+1}, p, O_i] \sim [O_{i+1}, q, O_{i-1}]$$

Should read:-

Assumption 1 (Downward trade-off). For any triple $O_{j-1}$ , $O_j$ , $O_i \in {\bf {\it O}}$ , where $j < i$ , and for any $p \in (0, 1)$ , there is a $q \in (0, 1)$ such that:

$$[O_i, p, O_j] \sim [O_i, q, O_{j-1}]$$

Page 6, line 16:-

Assumption 2 (Upward trade-off). For any triple $O_{j-1}$ , $O_j$ , $O_{j+1} \in {\bf {\it O}}$ and for any $p \in (0, 1)$ , there is a $q \in (0, 1)$ such that:

$$[O_j, p, O_{j-1}] \sim [O_{j+1}, q, O_{j-1}]$$

Should read:-

Assumption 2 (Upward trade-off). For any triple $O_j$ , $O_i$ , $O_{i+1} \in {\bf {\it O}}$ , where $j < i$ , and for any $p \in (0, 1)$ , there is a $q \in (0, 1)$ such that:

$$[O_i, p, O_j] \sim [O_{i+1}, q, O_{j}]$$

The author would like to apologize for this error.