Back to search

CSUniversity San Bernardino

Reverse Mathematics of Ramsey's Theorem

Abstract

dc:description.abstract

Reverse mathematics aims to determine which set theoretic axioms are necessary to prove the theorems outside of the set theory. Since the 1970’s, there has been an interest in applying reverse mathematics to study combinatorial principles like Ramsey’s theorem to analyze its strength and relation to other theorems. Ramsey’s theorem for pairs states that for any infinite complete graph with a finite coloring on edges, there is an infinite subset of nodes all of whose edges share one color. In this thesis, we introduce the fundamental terminology and techniques for reverse mathematics, and demonstrate their use in proving Kőnig's lemma and Ramsey's theorem over RCA0.

Degree

thesis:*
Name thesis:degree_name
Master of Arts in Mathematics
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Maslov, Nikolay
Contributors dc:contributor
  • Scow, Lynn

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://scholarworks.lib.csusb.edu/etd/1651

Chain of custody

source
Harvested from
CSUniversity San Bernardino
Base URL
scholarworks.lib.csusb.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Maslov, Nikolay. Reverse Mathematics of Ramsey's Theorem. Thesis thesis, https://scholarworks.lib.csusb.edu/etd/1651