Infinitary Combinatorics and Finitary Arithmetic
Offered By: BIMSA via YouTube
Course Description
Overview
Explore recent developments in reverse mathematics and the characterization of Ramsey-type combinatorial principles in this hour-long conference talk. Delve into the framework of reverse mathematics, which analyzes and calibrates the proof-theoretic strength of mathematical theorems. Learn how mathematical theorems are expressed in first or second-order language of arithmetic and how the class of sentences provable by a theorem over a base system is characterized. Gain insights into the latest advancements in the characterization problem of specific Ramsey-type combinatorial principles, bridging the gap between infinitary combinatorics and finitary arithmetic.
Syllabus
Chi Tat Chong: Infinitary combinatorics and finitary arithmetic #ICBS2024
Taught by
BIMSA
Related Courses
Language, Proof and LogicStanford University via edX Proof Theory Impressionism - Blurring the Curry-Howard Line
Strange Loop Conference via YouTube Topics in Pure Model Theory - Lecture 10
Fields Institute via YouTube David Cerna: Proof Schema and the Refutational Complexity of Their Cut Structure
Hausdorff Center for Mathematics via YouTube Graham Leigh: On the Computational Content of Classical Sequent Calculus
Hausdorff Center for Mathematics via YouTube