Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
alimw
on Dec 17, 2019
|
parent
|
context
|
favorite
| on:
Kurt Gödel and the Mechanization of Mathematics
> Note that if a system is inconsistent then everything is provable, thus if a system is consistent there must be a proposition which cannot be proved.
¬ ∀ (P Q : Prop), (P → Q) → (¬P → ¬Q)
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
¬ ∀ (P Q : Prop), (P → Q) → (¬P → ¬Q)