This book is a brief and focused introduction to the reverse mathematics and computability theory of combinatorial principles, an area of research which has seen a particular surge of activity in the last few years. It provides an overview of some fundamental ideas and techniques, and enough context to make it possible for students with at least a basic knowledge of computability theory and proof theory to appreciate the exciting advances currently happening in the area, and perhaps make contributions of their own. It adopts a case-study approach, using the study of versions of Ramsey's Theorem (for colorings of tuples of natural numbers) and related principles as illustrations of various aspects of computability theoretic and reverse mathematical analysis. This book contains many exercises and open questions.
Betal nemt med kort, Klarna, Apple Pay eller Google Pay. Ikke tilfreds? Du har altid 14 dages fortrydelsesret. Læs mere i vores vilkår. Har du spørgsmål, så send os en mail på hello@memmo.org.
Memmo gør det nemmere at studere – uanset hvor du er i verden. Hos os samler du dine kursusbøger og smarte studieværktøjer ét sted: resuméer, quizzer, podcasts og flashcards. Og så er der Ted, din studieven, der svarer på alt, du undrer dig over. Over 50 000 studerende studerer allerede her – bygget til at hjælpe dig med at lære hurtigere og stresse mindre.
Du kan måske også lide
Køb bogen0