Explore >> Select a destination
|
You are here 
|
tcode2k16.github.io | ||
| | | | |
danilafe.com
|
|
| | | | | ||
| | | | |
math.andrej.com
|
|
| | | | | [AI summary] The discussion revolves around the nuances of proof methods in constructive mathematics, particularly the distinction between proof by contradiction and proof by negation. Key points include the definition of irrational numbers without relying on the law of excluded middle, the use of contrapositive in proofs, and the limitations of certain classical theorems like the intermediate value theorem in constructive settings. The conversation also touches on the philosophical and practical implications of these proof methods in both classical and intuitionistic logic, as well as the role of type theory and univalent foundations in modern mathematical proofs. | |
| | | | |
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.blackbytes.info
|
|
| | | Ruby regular expressions are a very powerful technique you need to learn. In this tutorial I explain everything you need to know to get started. | ||
