Elliott Mendelson (1931–2020)

I use it, but this book makes me angry.

Actually, what makes me angry is the fact that for the Schaum's series there is no way (that I have been able to find) by which one can report errata. This would be a moot point if the books were perfect and error-free. This one certainly is not. My math skills are quite rusty and I am finding abundant errors and goofs.

This book has a copyright date of 1988, and mine is the latest printing ... in over twenty years they haven't been able to correct show more simple errors? I even hunted down the name/email of the McGraw-Hill editor responsible for the series and have emailed him twice: no response.

So the impression I'm getting from the company is: here it is, it's the only thing of it's kind, but we're never going to lift a little finger to improve it, so how do you like being over a barrel? Screw you, customer!

Sorry if that is hyperbolic. show less

As good or better than any calc book I've come across.

Indeholder "Foreword by Elliott Mendelson, January 1963", "Introduction", "Chapter 1. The Propositional Calculus", " 1. Propositional Connectives. Truth Tables", " 2. Tautologies", " 3. Adequate Sets of Connectives", " 4. An Axiom System for the Propositional Calculus", " 5. Independence. Many-Valued Logics", " 6. Other Axiomatizations", "Chapter 2. Quantification Theory", " 1. Quantifiers", " 2. Interpretations. Satisfiability and Truth. Models", " 3. First-Order Theories", " 4. Properties show more of First-Order Theories", " 5. Completeness Theorems", " 6. Some Additional Metatheorems", " 7. Rule C ", " 8. First-Order Theories with Equality", " 9. Definitions of New Function Letters and Individual Constants", " 10. Prenex Normal Forms", " 11. Isomorphism of Interpretations. Categoricity of Theories", " 12. Generalized First-Order Theories. Completeness and Decidability", "Chapter 3. Formal Number Theory", " 1. An Axiom System", " 2. Number-Theoretic Functions and Relations", " 3. Primitive Recursive and Recursive Functions", " 4. Arithmetization. Gödel Numbers", " 5. Gödel's Theorem for S", " 6. Recursive Undecidability. Tarski's Theorem. Robinson's System", "Chapter 4. Axiomatic Set Theory", " 1. An Axiom System", " 2. Ordinal Numbers", " 3. Equinumerosity. Finite and Denumerable Sets", " 4. Hartogs' Theorem. Initial Ordinals. Ordinal Arithmetic", " 5. The Axiom of Choice. The Axiom of Regularity", "Chapter 5. Effective Computability", " 1. Markov Algorithms", " 2. Turing Algorithms", " 3. Herbrand-Gödel Computability. Recursively Enumerable Sets", " 4. Undecidable Problems", "Appendix. A consistency proof for formal number theory", "Bibliography", "Index".

Lærebog i matematisk logik, mængdelære, aksiomsystemer, rekursivt enumerable mængder, uafgørlige problemer og meget andet, der læner sig en del op af datalogi. show less

511.3 MEN