
Re: SET THEORY and QUANTIFIER LOGIC are SUPERFLUOUS! You only need 1 or the other!
Posted:
Nov 22, 2012 2:39 PM


On Nov 20, 4:09 am, Graham Cooper <grahamcoop...@gmail.com> wrote: > The notation in > > { x  p(x) } > > stands for ALL VALUES OF x > that are satisfied in p(x) > > This is the SAME 'ALL' as ALL(x) ....predicate(..predicate... > x ...) ...) > > ALL is merely SUBSET! > > ALL(n):N n+1 > n > > is just > > { n  neN } C { n  n+1>n } > >
How do you propose to do proof by induction e.g. prove 1+2+3+...+n = n(n+1)/2?
Dan Download my DC Proof 2.0 software at http://www.dcproof.com

