All problems

  1. Modus ponens
  2. Falso
  3. Peirce
  4. Converse Peirce
  5. call/cc
  6. Sqrt 2
  7. Induction by tree height
  8. Seven trees
  9. PHP
  10. Increasing sequence 1
  11. Increasing sequence 2
  12. Even function
  13. Prime is decidable
  14. Ackermann
  15. Prop to Type
  16. Increasing sequence 3
  17. Square Stream
  18. McCarthy 91 function
  19. P < EXP
  20. Collatz conjecture
  21. Fibonacci function
  22. Tales of Tails
  23. Finite Bernstein
  24. Sum of natural numbers
  25. Coq.Reals sample
  26. pi > 3.05
  27. 8 bits Ascii
  28. PIE 3
  29. PIE
  30. Certified Compiler
  31. Pell's equation
  32. Square Lemma
  33. Perfect square is decidable
  34. Dirichlet's theorem on arithmetic progressions
  35. Certified Compressor
  36. FLT reduction to prime
  37. Bijective Function 1
  38. Bijective Function 2
  39. psatz sample
  40. Bijective Function 1 (revised)
  41. JMO2011-3
  42. snoc_inv
  43. snoc_inv
  44. snoc_inv(revised)
  45. (n+1)^n < n^(n+1)
  46. (n+1)^n < n^(n+1) (revised)
  47. GCJJ2011-R1-C
  48. Certified Brainfuck Echo
  49. Deduction theorem
  50. Ackermann function is not primitive recursive

return top