PROBLEMS IN SET THEORY, MATHEMATICAL LOGIC AND THE THEORY OF ALGORITHMS (The University Series in Mathematics)

Lavrov, Igor [Author] Maksimova, Larisa [Author] Corsi, Giovanna [Editor] Shehtman, Valentin [Translator]

ISBN 10: 0306477122 / ISBN 13: 9780306477126

Editore: Kluwer Academic/ Plenum Publishers, New York, 2003

Riguardo questo articolo

Octavo, xii, 282 pages. In Very Good condition. Dark blue spine with white lettering. Boards have mild shelving wear, mild finger-staining, and an adhesive stain on spine. Textblock has mild staining along head edge and mild wear along head and tail edges. Shelved ND-C. 1379857. FP New Rockville Stock. Codice articolo 1379857

Dati bibliografici

Titolo: PROBLEMS IN SET THEORY, MATHEMATICAL LOGIC ...

Casa editrice: Kluwer Academic/ Plenum Publishers, New York

Data di pubblicazione: 2003

Legatura: Hardcover

Edizione: First Edition, First Printing.

Descrizione articolo

Riassunto:

Problems in Set Theory, Mathematical Logic and the Theory of Algorithms by I. Lavrov & L. Maksimova is an English translation of the fourth edition of the most popular student problem book in mathematical logic in Russian. It covers major classical topics in proof theory and the semantics of propositional and predicate logic as well as set theory and computation theory. Each chapter begins with 1-2 pages of terminology and definitions that make the book self-contained. Solutions are provided. The book is likely to become an essential part of curricula in logic.

Contenuti:

Preface. I: Problems. 1. Set theory. 1.1. Operations on sets. 1.2. Relations and functions. 1.3. Special binary relations. 1.4. Cardinal numbers. 1.5. Ordinal numbers. 1.6. Operations on cardinal numbers. 2: Algebra. 2.1. Algebra of propositions. 2.2. Truth functions. 2.3. Propositional calculi. 2.4. The language of predicate logic. 2.5. Satisfiability of predicate formulas. 2.6. Predicate calculi. 2.7. Axiomatic theories. 2.8. Reduced products. 2.9. Axiomatizable classes. 3: Theory of algorithms. 3.1. Partial recursive functions. 3.2. Turing machines. 3.3. Recursive and recursively enumerable sets. 3.4. Kleene and Post numberings. II: Solutions. 1. Set theory. 1.1. Operations on sets. 1.2. Relations and functions. 1.3. Special binary relations. 1.4. Cardinal numbers. 1.5. Ordinal numbers. 1.6. Operations on cardinal numbers. 2. Mathematical logic. 2.1. Algebra of propositions. 2.2. Truth functions. 2.3. Propositional calculi. 2.4. The language of predicate logic. 2.5. Satisfiability of predicate formulas. 2.6. Predicate calculi. 2.7. Axiomatic theories. 2.8. Reduced products. 2.9. Axiomatizable classes. 3: Theory of algorithms. 3.1. Partial recursive functions. 3.2. Turing machines. 3.3. Recursive and recursively enumerable sets. 3.4. Kleene and Post numberings. References. Index.