Explore >> Select a destination
|
You are here 
|
www.themathdoctors.org | ||
| | | | |
principlesofcryptography.com
|
|
| | | | | Divisibility, common divisors, linear combination representation, relatively prime integers, Euclid's Lemma, and ?2 irrationality proof | |
| | | | |
adam.chlipala.net
|
|
| | | | | [AI summary] This text provides an in-depth exploration of advanced Coq proof techniques, focusing on manual proofs, recursion, and induction principles for complex data structures. It covers topics like nested inductive types, custom induction principles, and the design philosophy behind Coq's approach to proof automation. The text includes detailed examples of proof scripts, such as manual proofs for discrimination and injectivity of constructors, and discusses the use of tactics like discriminate and injection. It also touches on the implementation of functions like pred and the role of hints in improving proof readability and automation. | |
| | | | |
mathscholar.org
|
|
| | | | | ||
| | | | |
math.andrej.com
|
|
| | | [AI summary] A technical discussion distinguishing between proof by contradiction and proof of negation within the context of classical and intuitionistic logic. | ||
