leanprover / theorem_proving_in_lean

Theorem proving in Lean
Apache License 2.0
47 stars 46 forks source link

3.7 Exercises #102

Closed letrec closed 4 years ago

letrec commented 4 years ago

Explicit requirement to use classical logic for section 2 exercises somewhat implies that section 1 exercises are meant to be proven constructively, which contradicts the section 3 suggestion to prove ¬(p ↔ ¬p) (listed under 1) without using classical logic.

avigad commented 4 years ago

I will just delete it from problem 1. Thanks.