Top Answers

1. Can any additional axiom make Coq Turing complete?
   6 votes
2. Is it possible to prove `forall n: nat, le n 0 -> n = 0.` in Coq without using inversion?
   4 votes
3. Coq: goal is just a type (when using theorems with unnecessary arguments)
   4 votes
4. Can I safely assume that isomorphic types are equal?
   4 votes
5. Using a theorem on integer numbers for proving a theorem on natural numbers
   3 votes