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

DOI10.1142/S0219061318500137zbMATH Open1484.03067arXiv1808.04732MaRDI QIDQ5223119FDOQ5223119

Authors: Victoria Gitman, Vladimir Kanovei, Sy-David Friedman 

Publication date: 8 July 2019

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

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.

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

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

zbMATH Keywords

independencesecond-order arithmeticchoice-schemedependent choice-scheme

Mathematics Subject Classification ID

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

Cites Work

• Subsystems of second order arithmetic
• What is the theory ZFC without power set?
• A Minimal Model for � CH: Iteration of Jensen's Reals
• Title not available (Why is that?)
• A countable definable set containing no definable elements
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• On Russell typicality in set theory
• The full basis theorem does not imply analytic wellordering
• Boolean-valued class forcing
• On the relation between choice and comprehension principles in second order arithmetic
• 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
• INITIAL SELF-EMBEDDINGS OF MODELS OF SET THEORY
• THE Σ₁-DEFINABLE UNIVERSAL FINITE SEQUENCE
• 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

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)