home.social

#coqprover — Public Fediverse posts

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

fetched live
  1. Formalizing hyperspaces and operations on subsets of polish spaces over abstract exact real numbers. ~ Michal Konečný, Sewon Park, Holger Thies. arxiv.org/abs/2410.13508v1 #CoqProver #ITP #Math

  2. Formalizing hyperspaces and operations on subsets of polish spaces over abstract exact real numbers. ~ Michal Konečný, Sewon Park, Holger Thies. arxiv.org/abs/2410.13508v1 #CoqProver #ITP #Math

  3. A proof in Coq that core logic is not paraconsistent. ~ Joseph Vidal-Rosset. arxiv.org/abs/2606.05953v1 #CoqProver #ITP

  4. A proof in Coq that core logic is not paraconsistent. ~ Joseph Vidal-Rosset. arxiv.org/abs/2606.05953v1 #CoqProver #ITP

  5. Modelling and verifying neuronal archetypes in Coq. ~ Abdorrahim Bahrami, Rébecca Zucchini, Elisabetta De Maria, Amy Felty. arxiv.org/abs/2505.05362v1 #CoqProver #ITP

  6. Modelling and verifying neuronal archetypes in Coq. ~ Abdorrahim Bahrami, Rébecca Zucchini, Elisabetta De Maria, Amy Felty. arxiv.org/abs/2505.05362v1 #CoqProver #ITP

  7. Four paradoxes and a proof assistant: Burali-Forti, Diaconescu, Reynolds, and Hurkens in the coq-paradoxes library. ~ Bernardo Alonso. arxiv.org/abs/2605.27633v1 #CoqProver #ITP #Math

  8. Four paradoxes and a proof assistant: Burali-Forti, Diaconescu, Reynolds, and Hurkens in the coq-paradoxes library. ~ Bernardo Alonso. arxiv.org/abs/2605.27633v1 #CoqProver #ITP #Math

  9. Formal verification of Pohlig-Hellman algorithm for computing discrete logarithms with Coq. ~ Jeremiah Daniel A. Regalario et als. atlantis-press.com/article/126 #CoqProver #ITP

  10. Formal verification of Pohlig-Hellman algorithm for computing discrete logarithms with Coq. ~ Jeremiah Daniel A. Regalario et als. atlantis-press.com/article/126 #CoqProver #ITP

  11. Between Qed and truth (The permanent axiom trust boundary in machine-verified mathematics). ~ Ryan Christopher Fields. philarchive.org/archive/FIEBQA #CoqProver #ITP #Math

  12. Between Qed and truth (The permanent axiom trust boundary in machine-verified mathematics). ~ Ryan Christopher Fields. philarchive.org/archive/FIEBQA #CoqProver #ITP #Math

  13. A formally verified constructive proof of the consistency of Peano arithmetic using ordinal assignments. ~ Aaron Bryce, Rajeev Goré. arxiv.org/abs/2603.00487v1 #CoqProver #ITP #Math

  14. A formally verified constructive proof of the consistency of Peano arithmetic using ordinal assignments. ~ Aaron Bryce, Rajeev Goré. arxiv.org/abs/2603.00487v1 #CoqProver #ITP #Math

  15. Mechanized undecidability of higher-order beta-matching. ~ Andrej Dudenhefner. arxiv.org/abs/2602.02091 #ITP #CoqProver

  16. Mechanized undecidability of higher-order beta-matching. ~ Andrej Dudenhefner. arxiv.org/abs/2602.02091 #ITP #CoqProver

  17. Blurred drinker paradoxes and blurred choice axioms: Constructive reverse mathematics of the downward Löwenheim-Skolem theorem. ~ Dominik Kirst, Haoyi Zeng. arxiv.org/abs/2601.12592v1 #ITP #CoqProver #Logic #Math

  18. Blurred drinker paradoxes and blurred choice axioms: Constructive reverse mathematics of the downward Löwenheim-Skolem theorem. ~ Dominik Kirst, Haoyi Zeng. arxiv.org/abs/2601.12592v1 #ITP #CoqProver #Logic #Math