エピソード

  • Season 2 Recap: From Gödel to AI-Proved Math | aboutlogic #22
    2026/10/07
    Season 2 Recap: From Gödel to AI-Proved Math | aboutlogic #22 Nine guests, four emerging themes, and one big question running through all of it: what happens to mathematics when symbolic reasoning and statistical AI finally meet? In this Season 2 recap, Thorsten Altenkirch and Deniz Sarikaya look back at conversations with Urs Schreiber, Joel David Hamkins, Dana Scott, Emily Riehl, Bernhard Fisseni, Bernhard Schröder, José Pérez Escobar, Jan von Plato, Mike Shulman, Tudor Achim, and Neil Ghani — and preview where Season 3 is headed.
    続きを読む 一部表示
    27 分
  • aboutlogic: premises #09 | Why Symbolic AI Failed — and Then Won
    2026/09/30
    Why Symbolic AI Failed — and Then Won | aboutlogic Premises #09 Symbolic AI — "GOFAI" — was meant to be the foundation of machine intelligence, and it failed spectacularly in the 1980s. In this premises episode, Thorsten and Deniz explore why, and how statistical AI, the technology that replaced it, may now be quietly bringing symbolic reasoning back — including a Platonic twist: if Plato thought the world of ideas came first, modern AI suggests structure and reasoning actually emerge only after fuzzy, statistical pattern recognition. They land on what Thorsten calls a "paradoxical synthesis": statistical AI winning the race is exactly what now makes rigorous, formally verified symbolic AI possible.
    続きを読む 一部表示
    31 分
  • aboutlogic #21 | Category Theory Meets Agentic AI | Neil Ghani (Kodamai)
    2026/09/23
    Category Theory Meets Agentic AI | Neil Ghani (Kodamai) Why does almost all agentic AI today run completely untyped — even though 40 years of type theory and category theory research says that's a mistake? Neil Ghani, Co-Founder of Kodamai, Professor of Computer Science at the University of Strathclyde and a world-leading authority in Applied Category Theory, joins Deniz and Thorsten to explain how the same mathematical structures used to reason about data types can bring trustworthiness, scalability, and adaptability to AI agents. The conversation ranges from the origins of container theory to why LLMs are fundamentally untyped, whether category theory is "abstract nonsense," the GOFAI failures of the 1980s, and how formal verification tools like Lean might be the unlikely savior of both mathematics and AI.
    続きを読む 一部表示
    55 分
  • aboutlogic: premises #08 | Choice vs. Excluded Middle: A Constructive Paradox
    2026/09/16
    Choice vs. Excluded Middle: A Constructive Paradox | aboutlogic: premises #08 Constructive mathematics is all about building things explicitly — so why does it reject the Axiom of Choice, which sounds trivial in a constructive context. In this Premises episode, Thorsten walks Deniz through Diaconescu's theorem: the surprising proof that the Axiom of Choice implies the Law of Excluded Middle, turning a seemingly innocent principle into full-blown classical logic. Using an intuitive type-theoretic explanation (starting with a very relatable glove-matching example), Thorsten builds up to Diaconescu's classic argument, touching on propositional extensionality, the difference between intensional and extensional predicates, and why the Axiom of Choice turns out to be a stronger form of "magic" than Excluded Middle itself.
    続きを読む 一部表示
    33 分
  • aboutlogic #20 | Can AI Prove the Riemann Hypothesis? | Tudor Achim (Harmonic)
    2026/09/09
    Can AI prove the Riemann Hypothesis? Tudor Achim, CEO of Harmonic and creator of Aristotle — the first AI to win IMO gold and solve Erdős problems using the Lean theorem prover — joins Deniz and Thorsten to discuss how mathematical superintelligence is transforming research, education, and the very nature of proof.
    続きを読む 一部表示
    41 分
  • aboutlogic: premises #07 | Fixing Russell’s Paradox: The Birth of ZFC & Constructive Set Theory
    2026/09/02
    Fixing Russell’s Paradox: The Birth of ZFC & Constructive Set Theory How did mathematicians fix Russell’s paradox and save set theory? In this aboutlogic: premises episode, Deniz and Thorsten explore the solutions that reshaped the foundations of mathematics. From Zermelo-Fraenkel (ZFC) axioms to constructive set theories (IZF, CZF). Discover how large cardinals, the continuum hypothesis, and the iterative conception of sets became central to modern set theory and why some mathematicians still prefer type theory for its structural and computational advantages. Your support helps us keep these conversations going! If you’d like to contribute, you can buy us a coffee here: https://buymeacoffee.com/aboutlogic Or become a channel member here on Youtube. We’d love to have your support! https://www.youtube.com/@aboutlogic Join the Discussion: Have questions or thoughts to share? Drop a comment below and engage in a discussion with fellow viewers and experts.
    続きを読む 一部表示
    30 分
  • aboutlogic #19 | Homotopy Type Theory, Narya & the Future of Proof Assistants with Mike Shulman
    2026/08/26
    Homotopy Type Theory, Narya & the Future of Proof Assistants with Michael Shulman. How does homotopy type theory bridge the gap between abstract mathematics and computational proof systems? Mike Shulman (University of San Diego) joins Deniz and Thorsten to discuss his journey from topology to higher observational type theory, the development of the Narya proof assistant, and how these tools are reshaping the way we think about equality, equivalence, and computation in mathematics.
    続きを読む 一部表示
    1 時間 1 分
  • aboutlogic:premises #06 | What Is a Set? A Beginner’s Guide to Set Theory
    2026/08/19
    What Is a Set? A Beginner’s Guide to Set Theory | aboutlogic: premises #06 In this aboutlogic: premises episode, Deniz and Thorsten explore the foundations of set theory. From Cantor’s groundbreaking ideas to Frege’s logical foundations and Russell’s paradox. Discover how sets evolved from simple collections to a rigorous mathematical framework, and why the power set, well-ordering, and the continuum hypothesis remain some of the most fascinating (and controversial) ideas in math.
    続きを読む 一部表示
    27 分