{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":23,"n_cols":5,"rows_kept":23,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[16,2,16,3],[17,2,17,3],[20,2,20,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910954997603321"]
[null,null,"Autore",null,"Gries David"]
[null,null,"Titolo",null,"A Logical Approach to Discrete Math / / by David Gries, Fred B. Schneider"]
[null,null,"Pubbl/distr/stampa",null,"New York, NY : , : Springer New York : , : Imprint : Springer, , 1993"]
[null,null,"ISBN",null,"1-4757-3837-4"]
[null,null,"Edizione",null,"[1st ed. 1993.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XVI, 516 p.)"]
[null,null,"Collana",null,"Monographs in Computer Science, , 2512-5486"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Computer arithmetic and logic units"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Arithmetic and Logic Structures"]
[{"$nulls":4},"Computer Science"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"0 Using Mathematics -- 1 Textual Substitution, Equality, and Assignment -- 2 Boolean Expressions -- 3 Propositional Calculus -- 4 Relaxing the Proof Style -- 5 Applications of Propositional Calculus -- 6 Hilbert-style Proofs -- 7 Formal Logic -- 8 Quantification -- 9 Predicate Calculus -- 10 Predicates and Programming -- 11 A Theory of Sets -- 12 Mathematical Induction -- 13 A Theory of Sequences -- 14 Relations and Functions -- 15 A Theory of Integers -- 16 Combinatorial Analysis -- 17 Recurrence Relations -- 18 Modern Algebra -- 19 A Theory of Graphs -- 20 Infinite Sets -- References -- Theorems of the propositional and predicate calculi."]
[null,null,null,"Sommario/riassunto","This text attempts to change the way we teach logic to beginning students. Instead of teaching logic as a subject in isolation, we regard it as a basic tool and show how to use it. We strive to give students a skill in the propo­ sitional and predicate calculi and then to exercise that skill thoroughly in applications that arise in computer science and discrete mathematics. We are not logicians, but programming methodologists, and this text reflects that perspective. We are among the first generation of scientists who are more interested in using logic than in studying it. With this text, we hope to empower further generations of computer scientists and math­ ematicians to become "]
[{"$nulls":4},"serious users of logic. Logic is the glue Logic is the glue that binds together methods of reasoning, in all domains. The traditional proof methods -for example, proof by assumption, con­ tradiction, mutual implication, and induction- have their basis in formal logic. Thus, whether proofs are to be presented formally or informally, a study of logic can provide understanding."]