Page 1 of 1 [ 5 posts ] 

techn0teen
Veteran
Veteran

User avatar

Joined: 14 Sep 2010
Age: 33
Gender: Male
Posts: 663

16 Oct 2012, 2:35 am

I'm a 4th year computer science major. I feel my proof skills are lacking and being able to prove things in first-order logic (algorithm correctness, run time, time complexity) would really help me as a professional. However, when I attempt to learn, the introductory materials are very imposing. Is there a tutorial for proofs for CS students? One that is gentle, simple and then gradually builds in complexity? Preferably, I'd love one with lots of practice questions and full answers to the questions. That way, I can learn from my mistakes.



Trencher93
Velociraptor
Velociraptor

User avatar

Joined: 23 Jun 2008
Age: 124
Gender: Male
Posts: 464

16 Oct 2012, 5:03 am

Dover just published "Introduction to Proof in Abstract Mathematics".



ruveyn
Veteran
Veteran

User avatar

Joined: 21 Sep 2008
Age: 88
Gender: Male
Posts: 31,502
Location: New Jersey

19 Oct 2012, 9:21 pm

Look here: Lots of good titles.

http://www.amazon.com/s/ref=nb_sb_ss_i_ ... pbooks%2C0

ruveyn



Logicurse
Emu Egg
Emu Egg

User avatar

Joined: 21 Oct 2012
Age: 35
Gender: Male
Posts: 6

22 Oct 2012, 6:27 pm

The following site is a compendium of proofs:

proofwiki DOT org

The style of presentation is clear and the delivery is exceptionally rigorous.

While the previous posts mention books better suited to your needs I recommend trying to achieve the clarity of this website with each proof you create.



ruveyn
Veteran
Veteran

User avatar

Joined: 21 Sep 2008
Age: 88
Gender: Male
Posts: 31,502
Location: New Jersey