A computational logic
Boyer R.S., Moore J.S.
Unlike most texts on logic and mathematics, this book is about how to prove theorems rather than proof of specific results. We give our answers to such questions as: - When should induction be used? - How does one invent an appropriate induction argument? - When should a definition be expanded?
Kateqoriyalar:
İl:
1979
Nəşriyyat:
AP
Dil:
english
Səhifələr:
440
ISBN 10:
0121229505
ISBN 13:
9780121229504
Seriyalar:
ACM monograph series
Fayl:
PDF, 998 KB
IPFS:
,
english, 1979
Amazon 
Barnes & Noble 
Bookshop.org
Kitab mağazasını əlavə etmək istəyirsiniz? Bizimlə support@z-lib.do ilə əlaqə saxlayın
Faylları çevirin
Daha çox axtarış nəticəsi
Digər üstünlüklər ![Gert Smolka, Chad E. Brown — Introduction to Computational Logic (SS 2014) [lecture notes]](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/ad68e784aab52791835b8506c98c5c2596d4a6373a1732072d7e2cef8005b12f.jpg)
![Daniel P. Friedman & Carl Eastlund & Duane Bibby & J. Strother Moore & Matthias Felleisen [Friedman, Daniel P. & Eastlund, Carl & Bibby, Duane & Moore, J. Strother & Felleisen, Matthias] — The Little Prover](https://s3proxy.cdn-zlib.se/covers200/collections/userbooks/1d5bcaaaea5b870738e0fade698fee0073215e00ebc4a9f1b7a6cdeecd068a1f.jpg)
