Combinatorial Unprovability Proofs and Their Model-Theoretic Counterparts

Notre Dame Journal of Formal Logic 55 (2):231-244 (2014)
  Copy   BIBTEX

Abstract

For a function $f$ with domain $[X]^{n}$, where $X\subseteq\mathbb{N}$, we say that $H\subseteq X$ is canonical for $f$ if there is a $\upsilon\subseteq n$ such that for any $x_{0},\ldots,x_{n-1}$ and $y_{0},\ldots,y_{n-1}$ in $H$, $f=f$ iff $x_{i}=y_{i}$ for all $i\in\upsilon$. The canonical Ramsey theorem is the statement that for any $n\in\mathbb{N}$, if $f:[\mathbb{N}]^{n}\rightarrow\mathbb{N}$, then there is an infinite $H\subseteq\mathbb{N}$ canonical for $f$. This paper is concerned with a model-theoretic study of a finite version of the canonical Ramsey theorem with a largeness condition and also a version of the Kanamori–McAloon principle. As a consequence, we produce new indicators for cuts satisfying $\operatorname{PA}$

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,666

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

Countably perfectly Meager sets.Roman Pol & Piotr Zakrzewski - 2021 - Journal of Symbolic Logic 86 (3):1214-1227.
Parameterized partition relations on the real numbers.Joan Bagaria & Carlos A. Di Prisco - 2009 - Archive for Mathematical Logic 48 (2):201-226.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Compressibility and Kolmogorov Complexity.Stephen Binns & Marie Nicholson - 2013 - Notre Dame Journal of Formal Logic 54 (1):105-123.
A model with no magic set.Krzysztof Ciesielski & Saharon Shelah - 1999 - Journal of Symbolic Logic 64 (4):1467-1490.
Existence of some sparse sets of nonstandard natural numbers.Renling Jin - 2001 - Journal of Symbolic Logic 66 (2):959-973.

Analytics

Added to PP
2014-04-24

Downloads
34 (#606,060)

6 months
11 (#266,332)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On Gödel incompleteness and finite combinatorics.Akihiro Kanamori & Kenneth McAloon - 1987 - Annals of Pure and Applied Logic 33 (C):23-41.
An application of graphical enumeration to PA.Andreas Weiermann - 2003 - Journal of Symbolic Logic 68 (1):5-16.

Add more references