Mathematical Logic through Python, Noam Nisan, Yannai A. Gonczarowski
Автор: Mendelson Elliott Название: Introduction to Mathematical Logic ISBN: 1482237725 ISBN-13(EAN): 9781482237726 Издательство: Taylor&Francis Рейтинг: Цена: 8184.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
The new edition of this classic textbook, Introduction to Mathematical Logic, Sixth Edition explores the principal topics of mathematical logic. It covers propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability. The text also discusses the major results of G del, Church, Kleene, Rosser, and Turing.
The sixth edition incorporates recent work on G del's second incompleteness theorem as well as restoring an appendix on consistency proofs for first-order arithmetic. This appendix last appeared in the first edition. It is offered in the new edition for historical considerations. The text also offers historical perspectives and many new exercises of varying difficulty, which motivate and lead students to an in-depth, practical understanding of the material.
Автор: Plato Название: Elements of Logical Reasoning ISBN: 110761077X ISBN-13(EAN): 9781107610774 Издательство: Cambridge Academ Рейтинг: Цена: 3802.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book is an accessible and scientifically rigorous introduction to the principles of logical reasoning, covering many topics including the deductive machinery of metalogic, otherwise known as the nature and function of proofs. It will be valuable to students of logic, mathematics and computer science.
This book is a brief and focused introduction to the reverse mathematics and computability theory of combinatorial principles, an area of research which has seen a particular surge of activity in the last few years. It provides an overview of some fundamental ideas and techniques, and enough context to make it possible for students with at least a basic knowledge of computability theory and proof theory to appreciate the exciting advances currently happening in the area, and perhaps make contributions of their own. It adopts a case-study approach, using the study of versions of Ramsey's Theorem (for colorings of tuples of natural numbers) and related principles as illustrations of various aspects of computability theoretic and reverse mathematical analysis. This book contains many exercises and open questions.
Автор: Barendregt Название: Lambda Calculus with Types ISBN: 0521766141 ISBN-13(EAN): 9780521766142 Издательство: Cambridge Academ Рейтинг: Цена: 12830.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Typed lambda calculus is used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), which are used to design and verify IT products and mathematical proofs. This book reveals unexpected mathematical beauty in three classes of typing: simple types, recursive types and intersection types. Numerous exercises are provided.
Автор: Bauer Название: Secret History ISBN: 1466561866 ISBN-13(EAN): 9781466561861 Издательство: Taylor&Francis Рейтинг: Цена: 11942.00 р. Наличие на складе: Нет в наличии.
Описание: Winner of an Outstanding Academic Title Award from CHOICE Magazine Most available cryptology books primarily focus on either mathematics or history. Breaking this mold, Secret History: The Story of Cryptology gives a thorough yet accessible treatment of both the mathematics and history of cryptology. Requiring minimal mathematical prerequisites, the book presents the mathematics in sufficient detail and weaves the history throughout the chapters. In addition to the fascinating historical and political sides of cryptology, the author—a former Scholar-in-Residence at the U.S. National Security Agency (NSA) Center for Cryptologic History—includes interesting instances of codes and ciphers in crime, literature, music, and art. Following a mainly chronological development of concepts, the book focuses on classical cryptology in the first part. It covers Greek and Viking cryptography, the Vigenere cipher, the one-time pad, transposition ciphers, Jefferson’s cipher wheel, the Playfair cipher, ADFGX, matrix encryption, World War II cipher systems (including a detailed examination of Enigma), and many other classical methods introduced before World War II. The second part of the book examines modern cryptology. The author looks at the work of Claude Shannon and the origin and current status of the NSA, including some of its Suite B algorithms such as elliptic curve cryptography and the Advanced Encryption Standard. He also details the controversy that surrounded the Data Encryption Standard and the early years of public key cryptography. The book not only provides the how-to of the Diffie-Hellman key exchange and RSA algorithm, but also covers many attacks on the latter. Additionally, it discusses Elgamal, digital signatures, PGP, and stream ciphers and explores future directions such as quantum cryptography and DNA computing. With numerous real-world examples and extensive references, this book skillfully balances the historical aspects of cryptology with its mathematical details. It provides readers with a sound foundation in this dynamic field. Please visit Dr. Bauer's website, which provides access to exercise sets: http://depts.ycp.edu/~cbauer/
Описание: Paolo Mancosu presents an innovative set of studies of logic and the foundations of mathematics in the first half of the twentieth century. He sheds new light on important topics such as the relationship between phenomenology and the exact sciences, the nature of truth and logical consequence, and the nature of mathematical intuition.
Автор: Noam Nisan, Yannai A. Gonczarowski Название: Mathematical Logic through Python ISBN: 110884507X ISBN-13(EAN): 9781108845076 Издательство: Cambridge Academ Рейтинг: Цена: 9821.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Using a unique pedagogical approach, this text introduces mathematical logic by guiding students in implementing the underlying logical concepts and mathematical proofs via Python programming. This approach, tailored to the unique intuitions and strengths of the ever-growing population of programming-savvy students, brings mathematical logic into the comfort zone of these students and provides clarity that can only be achieved by a deep hands-on understanding and the satisfaction of having created working code. While the approach is unique, the text follows the same set of topics typically covered in a one-semester undergraduate course, including propositional logic and first-order predicate logic, culminating in a proof of Godel's completeness theorem. A sneak peek to Godel's incompleteness theorem is also provided. The textbook is accompanied by an extensive collection of programming tasks, code skeletons, and unit tests. Familiarity with proofs and basic proficiency in Python is assumed.
Описание: Category theory reveals commonalities between structures of all sorts. This self-contained tour of applied category theory shows its potential in science, engineering, and beyond. Each chapter discusses a real-world application using category-theoretic tools, all of which are introduced in an accessible way with many examples and exercises.
Автор: 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.
Автор: Sahrling, Mikael, Название: Fast techniques for integrated circuit design / ISBN: 1108498450 ISBN-13(EAN): 9781108498456 Издательство: Cambridge Academ Рейтинг: Цена: 15365.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Learn how to use estimation techniques to solve integrated circuit (IC) design problems, accelerate the design process, and enhance understanding of complex systems with this step-by-step guide. Using numerous real-world application examples, it is ideal for both early-career and established professionals and researchers, and graduate students, working in IC design.
Описание: This book gives a detailed treatment of functional interpretations of arithmetic, analysis, and set theory. The subject goes back to G del's Dialectica interpretation of Heyting arithmetic which replaces nested quantification by higher type operations and thus reduces the consistency problem for arithmetic to the problem of computability of primitive recursive functionals of finite types. Regular functional interpretations, in particular the Dialectica interpretation and its generalization to finite types, the Diller-Nahm interpretation, are studied on Heyting as well as Peano arithmetic in finite types and extended to functional interpretations of constructive as well as classical systems of analysis and set theory. Kreisel's modified realization and Troelstra's hybrids of it are presented as interpretations of Heyting arithmetic and extended to constructive set theory, both in finite types. They serve as background for the construction of hybrids of the Diller-Nahm interpretation of Heyting arithmetic and constructive set theory, again in finite types. All these functional interpretations yield relative consistency results and closure under relevant rules of the theories in question as well as axiomatic characterizations of the functional translations.
Автор: Toth, Herbert, Название: Relations : concrete, abstract, and applied : ISBN: 9811220344 ISBN-13(EAN): 9789811220340 Издательство: World Scientific Publishing Рейтинг: Цена: 24552.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
The book is intended as an invitation to the topic of relations on a rather general basis. It fills the gap between the basic knowledge offered in countless introductory papers and books (usually comprising orders and equivalences) and the highly specialized monographs on mainly relation algebras, many-valued (fuzzy) relations, or graphs. This is done not only by presenting theoretical results but also by giving hints to some of the many interesting application areas (also including their respective theoretical basics).
This book is a new -- and the first of its kind -- compilation of known results on binary relations. It offers relational concepts in both reasonable depth and broadness, and also provides insight into the vast diversity of theoretical results as well as application possibilities beyond the commonly known examples.
This book is unique by the spectrum of the topics it handles. As indicated in its title these are:
Concrete aspects are covered in detail in Part 2 for two-valued, and in Part 3 for many-valued relations. Various kinds of relations and their properties are presented in the familiar form of first order formulas, but mainly algebraically in the point-free version as used in the so-called calculus of relations.
Abstract points of view are the content of Part 4: The connections of relations to semigroups, as well as the concept of relation algebras, and how relations are handled within category theory are presented in some detail.
Applied relations in Part 5 give a broad spectrum of classical and newer topics where relations of various kinds play a dominant role. This way, readers should get an idea how diverse the possibililties are where relations can be used, and how mighty their modeling abilities turn out to be.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
