Introduction to Mathematical Proofs, Second Edition, Roberts
Автор: Lakatos Название: Proofs and Refutations ISBN: 1107534054 ISBN-13(EAN): 9781107534056 Издательство: Cambridge Academ Рейтинг: Цена: 3326.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Imre Lakatos`s influential and enduring work on the nature of mathematic discovery and development continues to be relevant to philosophers of mathematics. Including a specially commissioned preface written by Paolo Mancosu, and presented in a fresh twenty-first-century series livery, it is now available for a new generation of readers.
Автор: Cooper S. Barry, Truss John K., Hitchin N. J. Название: Sets and Proofs ISBN: 0521635497 ISBN-13(EAN): 9780521635493 Издательство: Cambridge Academ Рейтинг: Цена: 8710.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book and its sister volume, Models and Computability, provide readers with a comprehensive guide to the mathematical logic. All the authors are leaders in their fields and are drawn from invited speakers at `Logic Colloquium `97` (the major international meeting of the Association of Symbolic Logic).
Автор: Sylvie, Boldo Название: Computer arithmetic and Formal Proofs ISBN: 1785481126 ISBN-13(EAN): 9781785481123 Издательство: Elsevier Science Рейтинг: Цена: 22570.00 р. Наличие на складе: Поставка под заказ.
Описание:
Floating-point arithmetic is ubiquitous in modern computing, as it is the tool of choice to approximate real numbers. Due to its limited range and precision, its use can become quite involved and potentially lead to numerous failures. One way to greatly increase confidence in floating-point software is by computer-assisted verification of its correctness proofs.
This book provides a comprehensive view of how to formally specify and verify tricky floating-point algorithms with the Coq proof assistant. It describes the Flocq formalization of floating-point arithmetic and some methods to automate theorem proofs. It then presents the specification and verification of various algorithms, from error-free transformations to a numerical scheme for a partial differential equation. The examples cover not only mathematical algorithms but also C programs as well as issues related to compilation.
Описание: This text makes a great supplement and provides a systematic approach for teaching undergraduate and graduate students how to read, understand, think about, and do proofs.
Автор: Stewart David & Oliveira Suely Название: Building Proofs: A Practical Guide ISBN: 9814641308 ISBN-13(EAN): 9789814641302 Издательство: World Scientific Publishing Рейтинг: Цена: 3168.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
This book introduces students to the art and craft of writing proofs, beginning with the basics of writing proofs and logic, and continuing on with more in-depth issues and examples of creating proofs in different parts of mathematics, as well as introducing proofs-of-correctness for algorithms. The creation of proofs is covered for theorems in both discrete and continuous mathematics, and in difficulty ranging from elementary to beginning graduate level.
Just beyond the standard introductory courses on calculus, theorems and proofs become central to mathematics. Students often find this emphasis difficult and new. This book is a guide to understanding and creating proofs. It explains the standard "moves" in mathematical proofs: direct computation, expanding definitions, proof by contradiction, proof by induction, as well as choosing notation and strategies.
Автор: K. Kunen Название: Set Theory An Introduction To Independence Proofs, ISBN: 0444868399 ISBN-13(EAN): 9780444868398 Издательство: Elsevier Science Рейтинг: Цена: 8420.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Studies in Logic and the Foundations of Mathematics, Volume 102: Set Theory: An Introduction to Independence Proofs offers an introduction to relative consistency proofs in axiomatic set theory, including combinatorics, sets, trees, and forcing. The book first tackles the foundations of set theory and infinitary combinatorics. Discussions focus on the Suslin problem, Martin's axiom, almost disjoint and quasi-disjoint sets, trees, extensionality and comprehension, relations, functions, and well-ordering, ordinals, cardinals, and real numbers. The manuscript then ponders on well-founded sets and easy consistency proofs, including relativization, absoluteness, reflection theorems, properties of well-founded sets, and induction and recursion on well-founded relations. The publication examines constructible sets, forcing, and iterated forcing. Topics include Easton forcing, general iterated forcing, Cohen model, forcing with partial functions of larger cardinality, forcing with finite partial functions, and general extensions. The manuscript is a dependable source of information for mathematicians and researchers interested in set theory.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
