Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with proof-golf
Search options answers only
not deleted
user 39242
Proof-golf is a competition to prove a particular theorem/statement using the fewest number of substitutions/steps given a set of axioms.
28
votes
(A → B) → (¬B → ¬A)
88 82 77 72 steps
Thanks to H.PWiz for better combinator conversions that saved 10 steps!
Explanation
You might be familiar with the Curry–Howard correspondence, in which theorems correspond to typ …
- 40.1k
8
votes
Existential Golf
19 steps
(()) [double cut]
(AB()(((G)))) [insertion]
(AB(A)(((G)))) [iteration]
(((AB(A)))(((G)))) [double cut]
(((AB(A))(((G))))(((G)))) [iteration]
(((AB(A))(((G))))((H(G)))) [insertion]
((( …
- 40.1k
22
votes
(-a) × (-a) = a × a
18 steps
Not the first 18-step proof, but it’s simpler than the others.
(-a)*(-a)
= (-a)*(-a) + 0 [Axiom 2]
= (-a)*(-a) + ((-a)*a + -((-a)*a)) [Axiom 3]
= ((-a)* …
- 40.1k