| 
|
Quote: there are always short true statements concerning the addition of natural numbers whose formal proof is super-exponentially long
topics >
all references >
references p-r >
Topic:
theorem proving systems
Topic:
program proving is infeasible
Quotation Skeleton
This last result concerning the length of proofs … logic, or alternatively, for a very basic, simple … the statement to be proved. Briefly, there are … impossibly long. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: theorem proving systems (20 items)
Topic: program proving is infeasible (46 items)