MIU Formal System, Proof Theory Applied to Automated Theorem Proving

preview_player
Показать описание
Proof Theory Applied to Automated Theorem Proving: a presentation given in the graduate student seminar series at the University of Montana by Brian Tenneson on September 27, 2016.
  1. Brian Tenneson
  2. DeepMind
Рекомендации по теме
MIU Formal System, 0:38:49

MIU Formal System, Proof Theory Applied to Automated Theorem Proving

Topics in proof 0:06:58

Topics in proof theory, how many proofs of length m are there? MIU formal systems

Solution to the 0:02:23

Solution to the MU puzzle

Roger Penrose explains 0:03:39

Roger Penrose explains Godel's incompleteness theorem in 3 minutes

MIU in Mathematica, 0:32:14

MIU in Mathematica, OEIS.org sequence A331536

CS103 Lecture 9 0:13:13

CS103 Lecture 9

Proof Theory Foundations, 1:25:57

Proof Theory Foundations, Lecture 1

CS103 Lecture 10 0:15:34

CS103 Lecture 10

Calculus CL as 0:02:58

Calculus CL as a Formal System

Lemda Miu theorem 0:03:15

Lemda Miu theorem

Frankenstein's Secret (an 0:33:49

Frankenstein's Secret (an essay)

Theorem Proving with 0:50:38

Theorem Proving with Coq - Jaap Boender guest lecture

Desafio de lógica: 0:02:34

Desafio de lógica: Sistema MIU

Automated theorem proving 0:19:05

Automated theorem proving

Lecture 1 | 0:51:44

Lecture 1 | A survey of automated theorem proving | John Harrison | Лекториум

MIU Assignment6 CVBuilderApp 0:27:57

MIU Assignment6 CVBuilderApp

Metamath 0:16:40

Metamath

Sympony Theorem Prover 0:03:41

Sympony Theorem Prover Tutorial video

LAClecture8a 1:35:11

LAClecture8a

LAClecture9 1:40:42

LAClecture9

Automated theorem proving 0:24:50

Automated theorem proving | Wikipedia audio article

LAClecture8b 1:24:41

LAClecture8b

Interactive Theorem Proving 0:10:02

Interactive Theorem Proving (1-1)

Interactive Theorem Proving 0:08:56

Interactive Theorem Proving (2-2)

Комментарии
Автор

Errata volume 1: the slide visible at 22:13... It says in the middle, "In the MIU formal system, the grammar is the entire set of finite utterances." Close but it should say, "utterances that begin with M, have exactly one M, and have a finite subset of any length consisting of any finite sequence of symbols selected from the set {I, U}."

briantenneson