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

Studia Logica:1-16 (forthcoming)
  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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,963

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

Internal Categoricity in Arithmetic and Set Theory.Jouko Väänänen & Tong Wang - 2015 - Notre Dame Journal of Formal Logic 56 (1):121-134.
Arithmetic with Fusions.Jeff Ketland & Thomas Schindler - 2016 - Logique Et Analyse 234:207-226.
The Strength of Abstraction with Predicative Comprehension.Sean Walsh - 2016 - Bulletin of Symbolic Logic 22 (1):105–120.
An ordinal analysis of parameter free Π12-comprehension.Michael Rathjen - 2005 - Archive for Mathematical Logic 44 (3):263-362.
A very strong set theory?Andrzej Kisielewicz - 1998 - Studia Logica 61 (2):171-178.
A note on Goodman's theorem.Ulrich Kohlenbach - 1999 - Studia Logica 63 (1):1-5.
A Logic for Frege's Theorem.Richard Heck - 1999 - In Richard G. Heck (ed.), Frege’s Theorem: An Introduction. The Harvard Review of Philosophy.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.

Analytics

Added to PP
2024-04-25

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

A survey of proof theory.G. Kreisel - 1968 - Journal of Symbolic Logic 33 (3):321-388.
Iterated perfect-set forcing.James E. Baumgartner & Richard Laver - 1979 - Annals of Mathematical Logic 17 (3):271-288.
Perfect-set forcing for uncountable cardinals.Akihiro Kanamori - 1980 - Annals of Mathematical Logic 19 (1-2):97-114.

View all 11 references / Add more references