Explore >> Select a destination
|
You are here 
|
www.joachim-breitner.de | ||
| | | | |
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. | |
| | | | |
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. | |
| | | | |
www.jeremykun.com
|
|
| | | | | For those who aren't regular readers: as a followup to this post, there are four posts detailing the basic four methods of proof, with intentions to detail some more advanced proof techniques in the future. You can find them on this blog's primers page. Do you really want to get better at mathematics? Remember when you first learned how to program? I do. I spent two years experimenting with Java programs on my own in high school. | |
| | | | |
gelisam.blogspot.com
|
|
| | | Edward Kmett recently posted a puzzling gist seemingly showing that at the type level, the () kind has more than one inhabitant. The goal ... | ||
