The following pages link to (Q5302558):
Displaying 17 items.
- A certified proof of the Cartan fixed point theorems (Q438546) (← links)
- Automated theorem provers: a practical tool for the working mathematician? (Q657585) (← links)
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696) (← links)
- A revision of the proof of the Kepler conjecture (Q977177) (← links)
- Formalizing a fragment of combinatorics on words (Q2011632) (← links)
- A replication crisis in mathematics? (Q2154145) (← links)
- Formal verification of stability and chaos in periodic optical systems (Q2361358) (← links)
- Experimental mathematics, computers and the a priori (Q2441736) (← links)
- A formally verified compiler back-end (Q2655327) (← links)
- Homotopy type theory and Voevodsky’s univalent foundations (Q2933829) (← links)
- Checking Proofs (Q2950035) (← links)
- Beyond Provable Security Verifiable IND-CCA Security of OAEP (Q3073706) (← links)
- Mechanical Proofs of Properties of the Tribonacci Word (Q3449367) (← links)
- Formal Proof: Reconciling Correctness and Understanding (Q3637280) (← links)
- A Formalization of Properties of Continuous Functions on Closed Intervals (Q5041063) (← links)
- Towards Formal Proof Script Refactoring (Q5200123) (← links)
- Reshaping the metaphor of proof (Q5204811) (← links)
