Mathematical logic Courses and Certifications

Fields Institute

O-minimality and the Pila-Wilkie Theorem - Lecture 1

Explore o-minimality, its foundations, and key theorems in this graduate-level lecture, emphasizing mathematical concepts and their applications in tame geometry.

• YouTube
• 1 hour 40 minutes
• On-Demand
• Free Video

Fields Institute

Effectivity of Standard O-Minimal Results in the Sharply O-Minimal Setting

Explore the effectiveness of o-minimal results in sharply o-minimal contexts, covering algebraic lemmas, cellular versions, and cylindrical parametrization techniques.

• YouTube
• 39 minutes
• On-Demand
• Free Video

Fields Institute

Topics in Pure Model Theory - Lecture 10

Explore advanced concepts in pure model theory, including simple theory, invariant types, and symmetry, with expert insights from Itay Kaplan of The Hebrew University of Jerusalem.

• YouTube
• 1 hour 26 minutes
• On-Demand
• Free Video

Fields Institute

Topics in Pure Model Theory - Lecture 8

Explore stable theory, nonforking, and Kim's lemma in pure model theory with Prof. Itay Kaplan, delving into advanced concepts and proofs in this comprehensive lecture.

• YouTube
• 1 hour 32 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

David Cerna: Proof Schema and the Refutational Complexity of Their Cut Structure

Explore proof schemas, refutational complexity, and cut structures in mathematical logic. Gain insights into CERES, ECA, and 1-SMA concepts for advanced theorem proving techniques.

• YouTube
• 39 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Computing with Gödel's Completeness Theorem

Explore computational approaches to Gödel's completeness theorem, including Krivine's "exploding models," A-translation, and Kripke forcing, with insights on reifying validity proofs into derivability proofs.

• YouTube
• 46 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Two Observations on Intuitionistic Logic and Arithmetic

Explore intuitionistic logic and arithmetic through finite type formalisation and negative translations. Gain insights into extensional and intensional models, decidable atomic formulas, and equality at higher types.

• YouTube
• 36 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

First Order Concatenation Theory vs First Order Number Theory

Comparative analysis of first-order concatenation theory and number theory, exploring similarities, differences, and extensions with bounded quantifiers in string-based structures.

• YouTube
• 28 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Matthias Baaz - Fast Cut Elimination in Intuitionistic Logic

Explores elementary procedure for eliminating prenex cuts in intuitionistic logic, with implications for classical logic. Discusses surprising results in quantifier-based cut elimination.

• YouTube
• 37 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

The Absorption Law for Slow Provability

Explore the absorption law for slow provability, its simple proof, and application to Heyting Arithmetic's provability logic in this mathematical lecture by Albert Visser.

• YouTube
• 31 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Reverse Mathematics of Caristi's Fixed Point Theorem and Ekeland's Variational Principle

Explore the mathematical strengths of Caristi's fixed point theorem and Ekeland's variational principle, examining their implications in complete separable metric spaces and their connections to various axiom systems.

• YouTube
• 33 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Hugo Herbelin- Investigations into Cubical Type Theory

Exploration of a variant of cubical type theory with type-based equality, direct coercion, and primitive composition, aiming for a parametricity translation to identity type theory.

• YouTube
• 1 hour 2 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Ulrich Kohlenbach: Extraction of Information from Proofs

Explore proof mining techniques and their applications in mathematics, focusing on extracting computational content from nonconstructive proofs in analysis and ergodic theory.

• YouTube
• 57 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Ulrich Kohlenbach - Extraction of Information from Proofs

Explore proof theory and its applications in mathematics, focusing on extracting computational content from nonconstructive proofs for practical problem-solving.

• YouTube
• 1 hour 6 minutes
• On-Demand
• Free Video

Paul G. Allen School

On Making Mathematical Proof a Business - Allen School Distinguished Lecture

Explore how Amazon leverages automated reasoning and mechanized proof search in mathematical logic for software development, with insights on challenges and future scalability.

• YouTube
• 1 hour 11 minutes
• On-Demand
• Free Video