A model of second-order arithmetic satisfying AC but not DC

DOI10.1142/S0219061318500137MaRDI QIDQ5223119zbMATH OpenFDO

Authors Victoria Gitman, Vladimir Kanovei, Sy-David Friedman

Publication date 8 July 2019

Published in Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.04732

zbMATH Keywords

choice-schemedependent choice-schemeindependencesecond-order arithmetic

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Axiom of choice and related propositions (03E25) Consistency and independence results (03E35) Second- and higher-order arithmetic and fragments (03F35)

Abstract: We show that there is a $$-model of second-order arithmetic in which the choice scheme holds, but the dependent choice scheme fails for a $P{i}_2^1$-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 ${mZFC}^{-}$. This work is a rediscovery by the first two authors of a result obtained by the third author.

Recommendations

• On the relation between choice and comprehension principles in second order arithmetic
• The axiom of determinacy implies dependent choices in L(R)
• Transfinite dependent choice and ω-model reflection
• scientific article; zbMATH DE number 4043837
• scientific article; zbMATH DE number 1850737

Cites work

• A countable definable set containing no definable elements
• A Minimal Model for � CH: Iteration of Jensen's Reals
• scientific article; zbMATH DE number 3829895 (Why is no real title available?)
• scientific article; zbMATH DE number 3685477 (Why is no real title available?)
• scientific article; zbMATH DE number 922633 (Why is no real title available?)
• scientific article; zbMATH DE number 3346351 (Why is no real title available?)
• scientific article; zbMATH DE number 3387344 (Why is no real title available?)
• Subsystems of second order arithmetic
• What is the theory ZFC without power set?

Cited in

(16)

• The full basis theorem does not imply analytic wellordering
• On the relation between choice and comprehension principles in second order arithmetic
• INITIAL SELF-EMBEDDINGS OF MODELS OF SET THEORY
• Boolean-valued class forcing
• Models of set theory in which the separation theorem fails
• On the ‘definability of definable’ problem of Alfred Tarski, Part II
• TAKING REINHARDT’S POWER AWAY
• THE Σ₁-DEFINABLE UNIVERSAL FINITE SEQUENCE
• On Russell typicality in set theory
• A good lightface \(\varDelta_n^1\) well-ordering of the reals does not imply the existence of boldface \(\mathbf{\Delta}_{n - 1}^1\) well-orderings
• Axiomatization and forcing in set theory with urelements
• Descriptive choice principles and how to separate them
• The proof-theoretic strength of constructive second-order set theories
• Independence of the comprehension schema in second-order arithmetic from the parameter-free countable choice
• Very large set axioms over constructive set theories
• Parameterfree comprehension does not imply full comprehension in second order Peano arithmetic

This page was built for publication: A model of second-order arithmetic satisfying AC but not DC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223119)