Anonymous user
Talk:Proof: Difference between revisions
no edit summary
No edit summary |
|||
Line 70:
::::::: And, yes, this is a weak system of axioms. But no cases where this approach is insufficient are a part of this task as it is currently defined. And proofs always assume that their axioms are correct (which is how we can get away with denoting an infinite sequence in the first place.) --[[User:Rdm|Rdm]] 15:38, 5 June 2012 (UTC)
:::::::: With current version this holds:
::::::::
:::::::: <lang j>'A B' induction '(A addition A) equals (B addition B)'
'A B' induction '(A addition B) equals (B addition B)'
'A B' induction '(A addition A) equals (A addition B)'
</lang>
::::::::
:::::::: — [[User:Ht|Ht]] 19:06, 5 June 2012 (UTC)
== Huh? ==
| |||