Parameterfree Comprehension Does Not Imply Full Comprehension in Second Order Peano Arithmetic

Studia Logica 113 (1):109-124 (2025)
  Copy   BIBTEX

Abstract

The parameter-free part \(\textbf{PA}_2^*\) of \(\textbf{PA}_2\), second order Peano arithmetic, is considered. We make use of a product/iterated Sacks forcing to define an \(\omega \) -model of \(\textbf{PA}_2^*+ \textbf{CA}(\Sigma ^1_2)\), in which an example of the full Comprehension schema \(\textbf{CA}\) fails. Using Cohen’s forcing, we also define an \(\omega \) -model of \(\textbf{PA}_2^*\), in which not every set has its complement, and hence the full \(\textbf{CA}\) fails in a rather elementary way.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,795

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Parameter-Free Schemes in Second-Order Arithmetic.Victoria Gitman - forthcoming - Journal of Symbolic Logic:1-19.

Analytics

Added to PP
2025-02-07

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references