/explore
|
You are here 
|
relatedwork.blogspot.com | ||
| | | | |
existentialtype.wordpress.com
|
|
| | | | | It is well-known that constructivists renounce "proof by contradiction", and that classicists scoff at the critique. "Those constructivists," the criticismgoes, "want to rule out proofs by contradiction. How absurd! Look, Pythagoras showed that the square root of two is irrational by deriving a contradiction from the assumption that it is rational. There is nothing wrong... | |
| | | | |
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. | |
| | | | |
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. | |
| | | | |
dvt.name
|
|
| | | Gödel's incompleteness theorems have been hailed as "the greatest mathematical discoveries of the 20th century" - indeed, the theorems apply not only to mathematics, but all formal systems and have deep implications for science, logic, computer science, philosophy, and so on. In this post, I'll give a simple but rigorous sketch of Gödel's First Incompleteness ... | ||
