A model of second-order arithmetic satisfying AC but not DC
Journal of Mathematical Logic · 2019-06 · 19 (01) · 1850013
DOI: 10.1142/s0219061318500137 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Mathematical Logic, online erschienen am 11.06.2019. Verfasst von Sy-David Friedman und 2 weiteren Autor:innen. Die Arbeit wurde bisher 24-mal zitiert (Crossref) und nennt 9 Literaturangaben.
Abstract (Originalsprache)
We show that there is a [Formula: see text]-model of second-order arithmetic in which the choice scheme holds, but the dependent choice scheme fails for a [Formula: see text]-assertion, confirming a conjecture of Stephen Simpson. We obtain as a corollary that the Reflection Principle, stating that every formula reflects to a transitive set, can fail in models of [Formula: see text]. This work is a rediscovery by the first two authors of a result obtained by the third author in [V. G. Kanovei, On descriptive forms of the countable axiom of choice, Investigations on nonclassical logics and set theory, Work Collect., Moscow, 3-136 (1979)].
Zitieren
APA
Friedman, S., Gitman, V., & Kanovei, V. (2019). A model of second-order arithmetic satisfying AC but not DC. Journal of Mathematical Logic, 19(01), 1850013. https://doi.org/10.1142/s0219061318500137
Vancouver
Friedman S, Gitman V, Kanovei V. A model of second-order arithmetic satisfying AC but not DC. Journal of Mathematical Logic. 2019;19(01):1850013. doi:10.1142/s0219061318500137
BibTeX
@article{Friedman2019,
author = {Friedman, Sy-David and Gitman, Victoria and Kanovei, Vladimir},
title = {A model of second-order arithmetic satisfying AC but not DC},
journal = {Journal of Mathematical Logic},
year = {2019},
volume = {19},
number = {01},
pages = {1850013},
doi = {10.1142/s0219061318500137}
}
EUVIMED