Kanamori–McAloon theorem

Kanamori–McAloon theorem In mathematical logic, the Kanamori–McAloon theorem, due to Kanamori & McAloon (1987), gives an example of an incompleteness in Peano arithmetic, similar to that of the Paris–Harrington theorem. They showed that a certain finitistic theorem in Ramsey theory is not provable in Peano arithmetic (PA).

Statement Given a set {displaystyle ssubseteq mathbb {N} } of non-negative integers, Lassen {displaystyle min(s)} denote the minimum element of {Anzeigestil s} . Lassen {Anzeigestil [X]^{n}} denote the set of all n-element subsets of {Anzeigestil X} .

A function {Anzeigestil f:[X]^{n}rightarrow mathbb {N} } wo {displaystyle Xsubseteq mathbb {N} } is said to be regressive if {Anzeigestil f(s)

Wenn Sie andere ähnliche Artikel wissen möchten Kanamori–McAloon theorem Sie können die Kategorie besuchen Independence results.