Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Proof Mining in Bounded Arithmetic

Hausdorff Center for Mathematics via YouTube

Overview

Explore proof mining techniques in bounded arithmetic through this 44-minute lecture by Amirhossein Akbar Tabatabai, presented as part of the Hausdorff Trimester Program: Types, Sets and Constructions. Delve into the computational content of proofs, examining the canonical algorithm, language complexities, and computational reductions. Investigate the main lemma and theorem, focusing on the computability of characteristic functions. Gain insights into practical applications of these concepts in the field of mathematical logic and theoretical computer science.

Syllabus

Intro
The Computational Content
Proof Mining
The Canonical Algorithm
The language
Complexity Classes
Computational Reductions
The Main Lemma
Computability of Characteristic Functions
The proof of the Main Theorem
Applications II

Taught by

Hausdorff Center for Mathematics

Reviews

Start your review of Proof Mining in Bounded Arithmetic

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.