{"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":22,"n_cols":5,"rows_kept":22,"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],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[11,2,11,3],[12,2,12,3],[15,2,15,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910463750703321"]
[null,null,"Autore",null,"Conradie Willem <1978->"]
[null,null,"Titolo",null,"Logic and discrete mathematics : a concise introduction, solutions manual / / Willem Conradie, Valentin Goranko, Claudette Robinson"]
[null,null,"Pubbl/distr/stampa",null,"West Sussex, England : , : Wiley, , 2015"]
[{"$nulls":4},"©2015"]
[null,null,"ISBN",null,"1-119-00010-6"]
[null,null,"Descrizione fisica",null,"1 online resource (392 p.)"]
[null,null,"Disciplina",null,"004/.01/51"]
[null,null,"Soggetti",null,"Logic, Symbolic and mathematical"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Electronic books."]
[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","Description based upon print version of record."]
[null,null,"Nota di contenuto",null,"Cover; Table of Contents; Title Page; Copyright; Preface; About the Companion Website; Chapter 1: Preliminaries; 1.1 Sets; 1.2 Basics of Logical Connectives and Expressions; 1.3 Mathematical Induction; Chapter 2: Sets, Relations, Orders; 2.1 Set Inclusions and Equalities; 2.2 Functions; 2.3 Binary Relations and Operations on Them; 2.4 Special Binary Relations; 2.5 Equivalence Relations and Partitions; 2.6 Ordered Sets; 2.7 An Introduction to Cardinality; 2.8 Isomorphisms of Ordered Sets. Ordinal Numbers; 2.9 Application: relational databases; Chapter 3: Propositional Logic"]
[{"$nulls":4},"3.1 Propositions, Logical Connectives, Truth Tables, Tautologies3.2 Propositional Logical Consequence. Valid and Invalid Propositional Inferences; 3.3 Semantic Tableaux; 3.4 Logical Equivalences. Negating Propositional Formulae; 3.5 Normal forms. Propositional Resolution; Chapter 4: First-Order Logic; 4.1 Basic Concepts of First-Order Logic; 4.2 The Formal Semantics of First-Order Logic; 4.3 The Language of First-Order Logic: A Deeper Look; 4.4 Truth, Logical Validity, Equivalence and Consequence in First-Order Logic; 4.5 Semantic Tableaux for First-Order Logic"]
[{"$nulls":4},"4.6 Prenex and Clausal Normal Forms4.7 Resolution in First-Order Logic; 4.8 Applications of First-Order Logic to Mathematical Reasoning and Proofs; Chapter 5: Number Theory; 5.1 The Principle of Mathematical Induction revisited; 5.2 Divisibility; 5.3 Computing Greatest Common Divisors. Least Common Multiples; 5.4 Prime "]
[{"$nulls":4},"Numbers. The Fundamental Theorem of Arithmetic; 5.5 Congruence Relations; 5.6 Equivalence Classes and Residue Systems Modulo n; 5.7 Linear Diophantine Equations and Linear Congruences; 5.8 Chinese Remainder Theorem; 5.9 Euler's Function. Theorems of Euler and Fermat"]
[{"$nulls":4},"5.10 Wilson's Theorem. Order of an Integer5.11 Application: Public Key Cryptography; Chapter 6: Combinatorics; 6.1 Two Basic Counting Principles; 6.2 Combinations. The Binomial Theorem; 6.3 The Principle of Inclusion - Exclusion; 6.4 The Pigeonhole Principle; 6.5 Generalized Permutations, Distributions and the Multinomial Theorem; 6.6 Selections and Arrangements with Repetition;  Distributions of Identical Objects; 6.7 Recurrence Relations and Their Solution; 6.8 Generating Functions; 6.9 Recurrence Relations and Generating Functions; 6.10 Application: Classical Discrete Probability"]
[{"$nulls":4},"Chapter 7: Graph Theory7.1 Introduction to Graphs and Digraphs; 7.2 Incidence and Adjacency Matrices; 7.3 Weighted Graphs and Path Algorithms; 7.4 Trees; 7.5 Eulerian Graphs and Hamiltonian Graphs; 7.6 Planar Graphs; 7.7 Graph Colourings; End User License Agreement"]
[null,null,null,"Sommario/riassunto","Solutions manual to accompany Logic and Discrete Mathematics: A Concise Introduction This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade.   Written in a clear and reader-friendly style, each section ends with an extensive set of exercises, most of them provided with complete solutions which are available in this accompanying solutions manual."]