I am proud today to join the editorial board of a new diamond open access journal in logic:
Zeitschrift für Mathematische Logik
und Grundlagen der Mathematik
https://t.co/WIDgePLVp3
The website includes an open letter from the editorial board with the following text:
ICFP 2024 is just around the corner! It's going to be an exciting week, packed with presentations, co-located workshops, and community events. Can't wait to see you all there!
https://t.co/WpAcukBzSI
@jer_gib I used it as PC member of CiE, and my take home was that if it is avoidable to use EquinOCS by any means it should be avoided. Already bidding is such a painful experience because the system has multi second loading times between clicks, it's infuriating, and it only gets worse
@krismicinski@JustDeezGuy "The first" was what itched me a little. Lean is very successfully building on decades of lessons on building ITPs and of trying to convince the broader maths community. Of course you actually know that, but I tried to add some more public credit where credit where credit is due
@krismicinski@JustDeezGuy Clearly, the spread of mathlib and Lean through maths departments is unprecedented. But there's a history of 40 years of ITPs, most of them not even connected to type theory, some of them with millions of theorems and not a single one related to types or PL.
@krismicinski@JustDeezGuy I'm not even talking about Coq :) There was so much math formalised before Lean. What about flyspeck? Tom Hales was surely not part of any type theory bubble. What about all the work in Isabelle/HOL? And yes, sure, then also what about mathcomp?
@marcelloseri@PietroMonticone The proof relies on computation a lot. Coq has put lots of emphasis on making computation fast in the last decades. It would be interesting to see whether other proof assistants can keep up - but it would be a lot of work
I was asked to review the Coq proof by the https://t.co/sVcwFOfnQM team some weeks ago. It took me around 10 minutes to verify that the statement is correct, and then I let Coq run for 10 hours over night to check the proof. BB(5) indeed is 47176870!
BB(5) is now known to equal 47176870, thanks to a collaboratively-made Coq proof that decides the halting problem for all 5-state Turing machines by case analysis of ~180 million equivalence classes, which `coqc` can check in ~10 hours of wall-clock time.
https://t.co/P78jRWD5yP