home.social

#theorem-proving β€” Public Fediverse posts

Live and recent posts from across the Fediverse tagged #theorem-proving, aggregated by home.social.

fetched live
  1. Want to learn more about the latest developments on using AI and (interactive) theorem proving in Mathematics? Wait no longer!

    We have a great line-up of speakers at our online Workshop on AI and Theorem Provers in Mathematics. The workshop will be held online from 8th to 10th of April and attendance is free (registration required). For more details, visit the workshop website: aitpm.github.io/

    #math #itp #theoremProving #isabelleHOL #lean #llm #ai #formal_mehods #agda #hol #mathematics

  2. Terminal now can help you with formal proofs and theorem provers 🀯

    πŸ“ **lean-tui** β€” A TUI for visualizing Lean programs and proofs

    πŸ’― Live proof trees, data/effect flow views & real-time updates from your editor

    πŸ¦€ Written in Rust & built with @ratatui_rs

    ⭐ Source: codeberg.org/wvhulle/lean-tui

  3. Lean 4 is apparently the new secret sauce of #AI dominance, because who knew that theorem proving could be so *riveting*? πŸ€”βœ¨ But don't worry, before you can learn how to take over the world with math, you'll need to pass the Vercel Security Checkpoint IQ test, where only the chosen ones with #JavaScript enabled may proceed. πŸ›‚πŸ”’
    venturebeat.com/ai/lean4-how-t #Lean4 #TheoremProving #VercelSecurity #HackerNews #ngated

  4. First Proof (#1stProof): We ran an AI-only workflow (no human mathematical input) and published a writeup + outputs.
    Report: althofer.de/first-proof-compet
    Official: 1stproof.org/
    I’d appreciate critiqueβ€”especially rigor/correctness checks and suggestions for better verification.
    #1stProof #Mathematics #TheoremProving #AI

  5. Beating GPT-5: DeepSeekMath-V2 Self-Corrects Logic Errors Presentational View Introduction Mathematics with the aid of artificial intelligence, is advancing rapidly. Innovations such as informal th...

    #ai-in-mathematics #deepseekmath-v2 #deepseek-v3 #open-source-ai-model #theorem-proving

    Origin | Interest | Match
  6. Does anyone know if an inductive Nat datatype defined as a place-value system could replace the need to rewrite the PA definition to bigints in the compiler?

    #theoremProving #types #functional_programming

  7. Emily Riehl: How I became seduced by Univalent Foundations

    [tbh I think shes only disclosing her theoretical motivations her; I recall she was posting questions about Linux distros a few years ago, and if we're honest being a nerd is the actual reason 99% of people get into HoTT]
    youtube.com/watch?v=XIYoI5j5Fl

    #hott #mathematics #categorytheory #theoremproving

  8. DeepSeekMath‑V2 Γ¨ un AI che dimostra teoremi matematici passo dopo passo.
    Genera prove, le verifica con un LLM dedicato e corregge gli errori per migliorarsi continuamente. πŸ€–πŸ“

    #AIperLaMatematica #TheoremProving #VerificaAutomatica

  9. #CondensedDetachment example

    Axiom 1: ⊒ (πœ‘ β†’ (πœ“ β†’ πœ‘))
    Axiom 2: ⊒ ((πœ‘ β†’ (πœ“ β†’ πœ’)) β†’ ((πœ‘ β†’ πœ“) β†’ (πœ‘ β†’ πœ’)))
    Rule of Modus Ponens:
    β€’ Major hypothesis: ⊒ (πœ“ β†’ πœ‘)
    β€’ Minor hypothesis: ⊒ πœ“
    β€’ Resulting Assertion: ⊒ πœ‘
    β€”β€”
    D<major><minor> applies the Rule of Modus Ponens treating the two given tautologies as having metavariables living in different namespaces and returning the normalized result. We extend by using underscore as a placeholder, so D__ recovers the rule of modus ponens.
    β€”β€”
    "D2_" is proof of the rule:
    β€’ Hypothesis: ⊒ (πœ‘ β†’ (πœ“ β†’ πœ’))
    β€’ Resulting assertion: ⊒ ((πœ‘ β†’ πœ“) β†’ (πœ‘ β†’ πœ’))
    β€”β€”
    "D21" is a proof which unifies "1" ⊒ (πœ‘β€² β†’ (πœ“β€² β†’ πœ‘β€²)) with the hypothesis of "D2_" giving the substitution map 𝜎: {πœ‘β€² ↦ πœ‘, πœ“β€² ↦ πœ“, πœ’ ↦ πœ‘} resulting in the tautology: ⊒ ((πœ‘ β†’ πœ“) β†’ (πœ‘ β†’ πœ‘))

    (Note that unification can map variables from either side, but when faced with a variable matching a term has to match the variable to that term.)
    β€”β€”
    "DD21_" is proof of the rule:
    β€’ Hypothesis: ⊒ (πœ‘ β†’ πœ“)
    β€’ Resulting assertion: ⊒ ((πœ‘ β†’ πœ‘)
    β€”β€”
    "DD211" is a proof which unifies "1" ⊒ (πœ‘β€³ β†’ (πœ“β€³ β†’ πœ‘β€³)) with the hypothesis of "DD21_" giving the substitution map 𝜎: {πœ‘β€³ ↦ πœ‘, πœ“ ↦ (πœ“β€³ β†’ πœ‘)} resulting in the tautology: ⊒ (πœ‘ β†’ πœ‘)

    This has been adapted and expanded from a run of my symbolic-mgu pre-release crate. crates.io/crates/symbolic-mgu

    cargo run -r --bin compact -- --wide D__ 1 2 D2_ D21 DD21_ DD211

    #math #logic #theoremProving #rust #mostGeneralUnifier #mgu

  10. An abbreviated run for examining sub-proofs of propositional logic from Russell and Whitehead, and proving that they are all tautologies:

    ```
    % cargo test --features serde,bigint -r --test pmproofs_validation -- --include-ignored --no-capture

    running 1 test
    Validating PM subproofs...
    Variable limit: unlimited (bigint feature enabled)
    Total subproofs in database: 2997
    Processed 100/2997 subproofs...
    Processed 200/2997 subproofs...

    ...

    Processed 2800/2997 subproofs...
    Processed 2900/2997 subproofs...

    ========================================
    PM SUBPROOF VALIDATION RESULTS
    ========================================
    Total subproofs: 2997
    Parse failures: 0
    Skipped (too many variables): 0
    Validation errors: 0
    Not tautologies: 0
    Successfully validated: 2997

    βœ“ Successfully validated 2997 subproofs!
    test all_pm_subproofs_are_tautologies ... ok

    test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 2.60s

    ```

    #Rust #logic #math #theoremProving #condensedDetachment #mostGeneralUnifier #mgu

  11. I'm writing an open source math library in #Rust to do symbolic unification. (following Meredith, Robinson, Megill) It's in pre-release (v0.1.0-alpha.13) now but I'm nearly feature-complete and I'm beginning to write interesting demonstrations with it.

    I thought now would be a time to solicit feedback before the API stabilizes as per semantic versioning best practices.

    Like many compilers built on top of the LLVM architecture, un-optimized Rust is about 10 times slower than the optimized code produced with the --release flag. You can really notice this with the test that sets out to exhaustively produce all expressions on sets of limited operators until all 16 Boolean functions are produced. docs.rs/crate/symbolic-mgu/lat

    Also I run through Norm Megill's archive of shortest known proofs of propositional logic statements from Whitehead and Russell's Prinicipia Mathematica and test that they and all subproofs produce tautologies. docs.rs/crate/symbolic-mgu/lat

    Documentation: docs.rs/symbolic-mgu/latest/sy
    Distribution: crates.io/crates/symbolic-mgu
    Repository: github.com/arpie-steele/symbol

    #logic #theoremProving #condensedDetachment #mostGeneralUnifier #mgu #math

  12. We're thrilled to welcome Alexander Bentkamp to the Cryspen family!

    Alex joins our Tools and Proofs team with a deep background in automated and interactive theorem proving, especially with the Lean proof assistant. We're excited to have his expertise as we continue our work on formally verifying security-critical software.

    Welcome aboard, Alex!

    cryspen.com/post/welcome_alex/

    #Cryspen #Welcome #FormalVerification #TheoremProving

  13. πŸ€” Oh joy, another "Python for Dummies" guide that promises to solve world peace with 20 lines of code. πŸŽ‰ Who knew #Sudoku and N-Queens could be fixed with a side of theorem provingβ€”thanks Microsoft! πŸ₯³ But don't worry, you don't actually need to know Python, because why bother learning a "fun" language, right? πŸ™„
    ericpony.github.io/z3py-tutori #PythonForDummies #Microsoft #NQueens #TheoremProving #CodingHumor #HackerNews #ngated

  14. Claude Can (Sometimes) Prove It
    galois.com/articles/claude-can

    "Claude Code can complete many complex proof steps independently, but it still needs a β€˜project manager’ (me) to guide it through the whole formalization. But I think Claude Code points to a world where experts aren’t necessary, and theorem provers can be used by many more people.

    The rest of this post digs into what Claude Code can actually do...."

    #theoremProving #LLM #Lean

  15. REAL-Prover: Retrieval augmented Lean prover for mathematical reasoning. ~ Ziju Shen et als. arxiv.org/abs/2505.20613 #AI #TheoremProving #LeanProver #Math

  16. The Department of Computer Science, University of Oxford has released recordings of the recent Strachey Series Lectures featuring Leo de Moura and Kevin Buzzard:

    1️⃣ "Formalizing the Future: Lean's Impact on Mathematics, Programming, and AI" - Leo de Moura, Chief Architect of Lean

    Leo discusses how Lean provides a framework for machine-checkable mathematical proofs and code verification, enabling collaboration between mathematicians, software developers, and AI systems. He also outlines the work the Lean Focused Research Organization does to expand Lean’s capabilities and support the community.

    ➑️ Watch Leo's lecture here: podcasts.ox.ac.uk/formalizing-

    2️⃣ "Will Computers Prove Theorems?" with Kevin Buzzard, Professor of Mathematics, Imperial College

    Kevin examines the potential for AI systems and theorem provers to assist in mathematical discovery, addressing whether computers might someday find patterns in mathematics that humans have missed, and discusses the integration of language models with formal verification systems.

    ➑️ Watch Kevin's lecture here: podcasts.ox.ac.uk/will-compute

    #LeanLang #LeanProver #FormalVerification #Mathematics #AI #TheoremProving #OxfordCS

  17. Introducing #DeepSeekProverV2 - a new #opensource #LLM designed for formal theorem proving in Lean 4.

    The model builds on a recursive #TheoremProving pipeline powered by the company's DeepSeek-V3 foundation model.

    Learn more: bit.ly/3ZlTt7h

    #InfoQ #GenerativeAI

  18. The Lean FRO team met synchronously in Amsterdam last week for our annual team retreat, and to discuss upcoming work and our Year 3 roadmap! πŸ‡³πŸ‡±βœ¨

    We had very productive discussions around Lean's future in mathematics, software and hardware verification, and AI for math. It was energizing to see our team's commitment to Lean's continued growth in each of these domains.

    We're cooking up many exciting developments that will support both our mathematical community and our growing base of software verification users. Stay tuned for our full Y3 roadmap publication at the end of July!

    #LeanLang #LeanProver #Lean4 #FormalVerification #Programming #Mathematics #TheoremProving

  19. Channeling some PhD vacancies from our πŸ‡³πŸ‡± friends:

    Six fully-funded PhD positions (4 years) in the project "Cyclic Structures in Programs and Proofs – New Harmonies in Software Correctness by Construction"

    Deadline: Friday, May 23, 2025

    cyclic-structures.gitlab.io/va

    #FormalMethods #TheoremProving #NWOnl