Stephen Flood
Abstract
In this paper, we propose a weak regularity principle which is similar to both weak K\onig's lemma and Ramsey's theorem. We begin by studying the computational strength of this principle in the context of reverse mathematics. We then analyze different ways of generalizing this principle.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we propose a weak regularity principle which is similar to both weak K\onig's lemma and Ramsey's theorem. We begin by studying the computational strength of this principle in the context of reverse mathematics. We then analyze different ways of generalizing this principle.
Key concepts: Reverse mathematics, Lemma (botany), Ramsey theory, Mathematics, Context (archaeology), Type (biology), Discrete mathematics, Mathematical economics