formalizing macintyre's theorem in isabelle/hol
Published 2 years ago • 595 plays • Length 53:56Download video MP4
Download video MP3
Similar videos
-
![[cpp'23] a formalisation of the balog–szemerédi–gowers theorem in isabelle/hol](https://i.ytimg.com/vi/LdInaL74JOc/mqdefault.jpg)
20:29
[cpp'23] a formalisation of the balog–szemerédi–gowers theorem in isabelle/hol
-
33:34
formalising advanced mathematics in isabelle/hol
-
54:41
tech weeklies - theorem proving: what, how and why? - isabelle/hol - 08/21 - jan van brügge
-
20:17
the poincare-bendixson theorem in isabelle/hol
-
1:05:37
jan van brügge - a new way to formalizing binders in isabelle/hol
-
![[cpp'23] a first complete algorithm for real quantifier elimination in isabelle/hol](https://i.ytimg.com/vi/lEk6kSTswTQ/mqdefault.jpg)
23:54
[cpp'23] a first complete algorithm for real quantifier elimination in isabelle/hol
-
40:25
cyril cohen: building measure theory using hierarchy builder
-
![[cpp'22] an extension of the framework types-to-sets for isabelle/hol](https://i.ytimg.com/vi/ljBRppe5oXk/mqdefault.jpg)
23:01
[cpp'22] an extension of the framework types-to-sets for isabelle/hol
-
1:35:15
structuring mathematics in higher-order logic by clemens ballarin (aicas gmbh karlsruhe, germany)
-
28:36
štěpán holub, formalization of combinatorics on words in isabelle/hol
-
1:09:59
lawrence paulson | doing mathematics with simple types: infinitary combinatorics in isabelle/hol
-
12:41
smart induction for isabelle/hol (fmcad2020)
-
![[ftscs] proving memory access violations in isabelle/hol](https://i.ytimg.com/vi/IXa7RDIrGnU/mqdefault.jpg)
28:14
[ftscs] proving memory access violations in isabelle/hol
-
17:16
faster smarter proof by induction in isabelle/hol (ijcai2021)
-
19:30
fm'21 | session 8 : hybrid systems verification with isabelle/hol: simpler syntax, better models...
-
1:11:31
lawrence paulson: "formalising contemporary mathematics in simple type theory"
-
49:20
wenda li: reasoning with non-linear formulas in isabelle/hol