An Introduction to Ramsey Theory

An Introduction to Ramsey Theory : Fast Functions, Infinity, and Metamathematics

By (author)  , By (author) 

List price: US$52.00

Currently unavailable

We can notify you when this item is back in stock

Add to wishlist

Description

This book takes the reader on a journey through Ramsey theory, from graph theory and combinatorics to set theory to logic and metamathematics. Written in an informal style with few requisites, it develops two basic principles of Ramsey theory: many combinatorial properties persist under partitions, but to witness this persistence, one has to start with very large objects. The interplay between those two principles not only produces beautiful theorems but also touches the very foundations of mathematics. In the course of this book, the reader will learn about both aspects. Among the topics explored are Ramsey's theorem for graphs and hypergraphs, van der Waerden's theorem on arithmetic progressions, infinite ordinals and cardinals, fast growing functions, logic and provability, Godel incompleteness, and the Paris-Harrington theorem.

Quoting from the book, ``There seems to be a murky abyss lurking at the bottom of mathematics. While in many ways we cannot hope to reach solid ground, mathematicians have built impressive ladders that let us explore the depths of this abyss and marvel at the limits and at the power of mathematical reasoning at the same time. Ramsey theory is one of those ladders.'' This book is published in cooperation with Mathematics Advanced Study Semesters.
show more

Product details

  • Paperback | 207 pages
  • 140 x 216 x 19.05mm | 263.08g
  • Providence, United States
  • English
  • 1470442906
  • 9781470442903
  • 1,112,952

Table of contents

Graph Ramsey theory
Infinite Ramsey theory
Growth of Ramsey functions
Metamathematics
Bibliography
Notation
Index.
show more

About Matthew Katz

Matthew Katz, Pennsylvania State University, University Park, PA.

Jan Reimann, Pennsylvania State University, University Park, PA.
show more