{"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":21,"n_cols":5,"rows_kept":21,"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],[13,2,13,3],[14,2,14,3],[18,2,18,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910300255203321"]
[null,null,"Autore",null,"Nievergelt Yves"]
[null,null,"Titolo",null,"Logic, Mathematics, and Computer Science : Modern Foundations with Practical Applications / / by Yves Nievergelt"]
[null,null,"Pubbl/distr/stampa",null,"New York, NY : , : Springer New York : , : Imprint : Springer, , 2015"]
[null,null,"ISBN",null,"1-4939-3223-3"]
[null,null,"Edizione",null,"[2nd ed. 2015.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 391 p. 9 illus., 4 illus. in color.)"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Logic, Symbolic and mathematical"]
[{"$nulls":4},"Number theory"]
[{"$nulls":4},"Mathematical Logic and Foundations"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$nulls":4},"Number Theory"]
[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","\"Adapted from Foundations of Logic and Mathematics : Applications to Computer Science and Cryptography\"--Preface."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Preface -- 1. Propositional Logic: Proofs from Axioms and Inference Rules -- 2. First Order Logic: Proofs with Quantifiers -- 3. Set Theory: Proofs by Detachment, Contraposition, and Contradiction -- 4. Mathematical Induction: Definitions and Proofs by Induction -- 5. Well-Formed Sets: Proofs by Transfinite Induction with Already Well-Ordered Sets -- 6. The Axiom of Choice: Proofs by Transfinite Induction -- 7. Applications: Nobel-Prize Winning Applications of Sets, Functions, and Relations -- 8. Solutions to Some Odd-Numbered Exercises -- References -- Index."]
[null,null,null,"Sommario/riassunto","This text for the first or second year undergraduate in mathematics, logic, computer science, or social sciences, introduces the reader to logic, proofs, sets, and number theory. It also serves as an excellent independent study reference and resource for instructors. Adapted from Foundations of Logic and Mathematics: Applications to Science and Cryptography © 2002 Birkhӓuser, this second edition provides a modern introduction to the foundations of logic, mathematics, and computers science, developing the theory that demonstrates construction of all mathematics and theoretical computer science from logic and set theory.  The focus is on foundations, with specific statements of all the associated axioms and rules of logic and set theory, and  provides complete details and derivations of formal proofs. "]
[{"$nulls":4},"Copious references to literature that document historical development is also provided. Answers are found to many questions that usually remain unanswered: Why is the truth table for logical implication so unintuitive? Why are there no recipes to design proofs? Where do these numerous mathematical rules come from? What issues in logic, mathematics, and computer science still remain unresolved? And the perennial question: In what ways are we going to use this material?   Additionally, the selection of topics presented reflects many major accomplishments from the twentieth century and includes applications in game theory and Nash's e quilibrium, Gale and Shapley's match making algorithms, Arrow's Impossibility Theorem in voting, to name a few. From the reviews of the first edition: \"...All the results are proved in full detail from first principles...remarkably, the arithmetic laws on the rational numbers are proved, step after step, starting from the very definitions!...This is a valuable reference text and a useful companion for anybody wondering how basic mathematical concepts can be rigorously developed within set theory.\" —MATHEMATICAL REVIEWS \"Rigorous and modern in its theoretical aspect, attractive as a detective novel in its applied aspects, this paper book deserves the attention of both beginners and advanced students in mathematics, logic and computer sciences as well as in social sciences.\" —Zentralblatt MATH  ."]