Rezultati pretraživanja
  1. 19. ruj 2019.

    OK, so now item 24 on this list of 100 theorems has an *unconditional* formal proof: You can read about it in this paper:

  2. 13. sij

    I'm teaching algebraic geometry this term. Today is lecture one and I'm going to talk about why the union of two algebraic sets is an algebraic set. I'm formalising the proof in ! My Lean repository is hosted on github at

  3. 1. ožu 2019.

    Futuristic Mathematics: Computer-based Theorem Verification, Computer-based proof assistance: (great overview with many useful links and context!)

  4. 16. kol 2019.
  5. 1. stu 2019.

    repeat {rw pow_zero}, ring, The natural number game.

  6. 25. sij
  7. 22. sij

    In my alg geom course I prove V(I(V(S)))=V(S), for S a subset of k[X_1,X_2,...,X_n] and V and I the usual functions in the theory of affine alg varieties. I abstracted it and turned it into a new Lean maths challenge

  8. 7. sij

    I've finished updating Lean for Hackers for tonight: Follow along and you'll learn how to setup Lean and dive right into "Hello, world!" and "Hello, ${name}". This is a guide for hackers so I skip the theory and get straight to it.

  9. 27. stu 2019.

    Flypitch project paper, accepted to CPP (Certified Programs and Proofs) 2020

  10. 2. stu 2019.
  11. 5. ruj 2019.

    I watched Kevin Buzzard talking about LEAN and CoCalc today at Microsoft Research.

  12. 2. velj

    Beyond notations: Hygienic macro expansion for theorem proving languages. ~ Sebastian Ullrich, Leonardo de Moura.

  13. 10. sij

    Updated the hackers' guide to Lean with a guessing game example:

  14. 28. sij

    Cambridge maths PhD student Bhavik Mehta has formalised around 1/3 of the Part III (MSc) combinatorics course in . Thorough write-up at . Finite sets are tricky, but this is evidence that the API is now there in Lean.

    Prikaži ovu nit
  15. 1. velj
  16. 31. sij

    I'm on the way to the Hausdorff center for the / ForTheL weekender :-) See you there!

  17. 28. sij
    Odgovor korisnicima

    It's not so much that I like classical logic, it's just that I don't understand any other kind! I don't know if P is true or false either -- that's why I checked all the cases ;-) Actually, taught me how to think constructively and I can check Chris' proof in Lean.

  18. 26. sij

    Coherence via wellfoundedness. ~ Nicolai Kraus, Jakob von Raumer.

  19. 25. sij

    Resumen de lecturas de programación funcional y demostración asistida por ordenador del 19 al 24 de enero.

  20. 23. sij

    I wrote: “instance : applicative parser := {! !}” and with an editor command it popped in the methods with holes for me. is great. I want this in

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.