Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T05:29:27.730Z Has data issue: false hasContentIssue false

THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES

Published online by Cambridge University Press:  01 December 2016

WEI WANG*
Affiliation:
INSTITUTE OF LOGIC AND COGNITION AND DEPARTMENT OF PHILOSOPHY SUN YAT-SEN UNIVERSITY, 135 XINGANG XI ROAD GUANGZHOU 510275, P.R. CHINA E-mail: wwang.cn@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a definable set. We prove that some consequences of Ramsey’s Theorem for colorings of pairs could help in simplifying the definitions of some ${\rm{\Delta }}_2^0$ sets, while some others could not. We also investigate some consequences of Ramsey’s Theorem for colorings of longer tuples. These results of definability strength have some interesting consequences in reverse mathematics, including strengthening of known theorems in a more uniform way and also new theorems.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2016