Автор: J. Roger Hindley Название: Lambda-Calculus and Combinators ISBN: 0521898854 ISBN-13(EAN): 9780521898850 Издательство: Cambridge Academ Рейтинг: Цена: 10771.00 р. Наличие на складе: Есть (1 шт.) Описание: This book gives an account of combinatory logic and lambda-calculus. The grammar and basic properties of both systems are discussed, followed by explanations of type-theory and lambda-calculus models. The treatment is as non-technical as possible with many examples and exercises.
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.
Автор: Huffman, W. Cary , Kim, Jon-Lark , Sole, Patrick Название: Concise Encyclopedia of Coding Theory ISBN: 1138551996 ISBN-13(EAN): 9781138551992 Издательство: Taylor&Francis Рейтинг: Цена: 32921.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Coding theory has grown into a discipline with many practical applications requiring various mathematical techniques in the last few decades. Most topics covered in this book are presented in short sections at an introductory level and progress from basic to advanced level, with definitions, examples, and many references.
Автор: B. Sethuraman Название: Proofs and Ideas: A Prelude to Advanced Mathematics ISBN: 1470465140 ISBN-13(EAN): 9781470465148 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 10659.00 р. Наличие на складе: Нет в наличии.
Описание: Proofs and Ideas serves as a gentle introduction to advanced mathematics for students who previously have not had extensive exposure to proofs. It is intended to ease the student's transition from algorithmic mathematics to the world of mathematics that is built around proofs and concepts.The spirit of the book is that the basic tools of abstract mathematics are best developed in context and that creativity and imagination are at the core of mathematics. So, while the book has chapters on statements and sets and functions and induction, the bulk of the book focuses on core mathematical ideas and on developing intuition. Along with chapters on elementary combinatorics and beginning number theory, this book contains introductory chapters on real analysis, group theory, and graph theory that serve as gentle first exposures to their respective areas. The book contains hundreds of exercises, both routine and non-routine.This book has been used for a transition to advanced mathematics courses at California State University, Northridge, as well as for a general education course on mathematical reasoning at Krea University, India.
Автор: Fenstad Название: General Recursion Theory ISBN: 1107168163 ISBN-13(EAN): 9781107168169 Издательство: Cambridge Academ Рейтинг: Цена: 18216.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume presents a unified and coherent account of general recursion theory. The main core of the book gives an account of the general theory of computations, then the author moves on to show how computation theories connect and unify other parts of recursion theory.
Автор: Andrew Crompton, Florian Grote, Fred Cummins, Graham Ellsbury, Leon Conrad, Louis H Kauffman, Randolph Dible Название: Laws Of Form: A Fiftieth Anniversary ISBN: 9811247420 ISBN-13(EAN): 9789811247422 Издательство: World Scientific Publishing Рейтинг: Цена: 27720.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Laws of Form is a seminal work in foundations of logic, mathematics and philosophy published by G Spencer-Brown in 1969. The book provides a new point of view on form and the role of distinction, markedness and the absence of distinction (the unmarked state) in the construction of any universe. A conference was held August 8-10, 2019 at the Old Library, Liverpool University, 19 Abercromby Square, L697ZN, UK to celebrate the 50th anniversary of the publication of Laws of Form and to remember George Spencer-Brown, its author. The book is a collection of papers introducing and extending Laws of Form written primarily by people who attended the conference in 2019.
Описание: Readers will learn how to automatically prove or disprove new results in combinatorics and number theory in milliseconds by phrasing their desired results in first-order logic and using free software to automate the computation process. Containing more than 150 exercises, this text is an ideal resource for students and researchers.
Автор: Smullyan Raymond M Название: Beginner`S Further Guide To Mathematical Logic, A ISBN: 9814725722 ISBN-13(EAN): 9789814725729 Издательство: World Scientific Publishing Рейтинг: Цена: 3168.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 'A wealth of examples to which solutions are given permeate the text so the reader will certainly be active.'The Mathematical GazetteThis is the final book written by the late great puzzle master and logician, Dr. Raymond Smullyan.This book is a sequel to my Beginner's Guide to Mathematical Logic.The previous volume deals with elements of propositional and first-order logic, contains a bit on formal systems and recursion, and concludes with chapters on G del's famous incompleteness theorem, along with related results.The present volume begins with a bit more on propositional and first-order logic, followed by what I would call a 'fein' chapter, which simultaneously generalizes some results from recursion theory, first-order arithmetic systems, and what I dub a 'decision machine.' Then come five chapters on formal systems, recursion theory and metamathematical applications in a general setting. The concluding five chapters are on the beautiful subject of combinatory logic, which is not only intriguing in its own right, but has important applications to computer science. Argonne National Laboratory is especially involved in these applications, and I am proud to say that its members have found use for some of my results in combinatory logic.This book does not cover such important subjects as set theory, model theory, proof theory, and modern developments in recursion theory, but the reader, after studying this volume, will be amply prepared for the study of these more advanced topics.
Автор: Manuel Bodirsky Название: Complexity of Infinite-Domain Constraint Satisfaction ISBN: 1107042844 ISBN-13(EAN): 9781107042841 Издательство: Cambridge Academ Рейтинг: Цена: 20750.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Introduces the universal-algebraic approach to the complexity classification of constraint satisfaction problems in the finite and infinite-domain cases. Including background material from logic, topology, and combinatorics, it is suitable for graduate students and researchers in theoretical computer science and adjacent areas of mathematics.
Автор: Smullyan Raymond M Название: Beginner`S Further Guide To Mathematical Logic, A ISBN: 9814730998 ISBN-13(EAN): 9789814730990 Издательство: World Scientific Publishing Рейтинг: Цена: 8870.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 'A wealth of examples to which solutions are given permeate the text so the reader will certainly be active.'The Mathematical GazetteThis is the final book written by the late great puzzle master and logician, Dr. Raymond Smullyan.This book is a sequel to my Beginner's Guide to Mathematical Logic.The previous volume deals with elements of propositional and first-order logic, contains a bit on formal systems and recursion, and concludes with chapters on G del's famous incompleteness theorem, along with related results.The present volume begins with a bit more on propositional and first-order logic, followed by what I would call a 'fein' chapter, which simultaneously generalizes some results from recursion theory, first-order arithmetic systems, and what I dub a 'decision machine.' Then come five chapters on formal systems, recursion theory and metamathematical applications in a general setting. The concluding five chapters are on the beautiful subject of combinatory logic, which is not only intriguing in its own right, but has important applications to computer science. Argonne National Laboratory is especially involved in these applications, and I am proud to say that its members have found use for some of my results in combinatory logic.This book does not cover such important subjects as set theory, model theory, proof theory, and modern developments in recursion theory, but the reader, after studying this volume, will be amply prepared for the study of these more advanced topics.
Название: Guide To Pairing-Based Cryptography ISBN: 1498729509 ISBN-13(EAN): 9781498729505 Издательство: Taylor&Francis Рейтинг: Цена: 13779.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
This book is devoted to efficient pairing computations and implementations, useful tools for cryptographers working on topics like identity-based cryptography and the simplification of existing protocols like signature schemes.
As well as exploring the basic mathematical background of finite fields and elliptic curves, Guide to Pairing-Based Cryptography offers an overview of the most recent developments in optimizations for pairing implementation. Each chapter includes a presentation of the problem it discusses, the mathematical formulation, a discussion of implementation issues, solutions accompanied by code or pseudocode, several numerical results, and references to further reading and notes.
Intended as a self-contained handbook, this book is an invaluable resource for computer scientists, applied mathematicians and security professionals interested in cryptography.
Автор: C.S. Calude; M.J. Dinneen; S. Sburlan Название: Combinatorics, Computability and Logic ISBN: 1852335262 ISBN-13(EAN): 9781852335267 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume contains the papers presented at the Third Combinatorics, Computability and Logic (DMTCS`01) conference, These papers cover topics such as abstract data types and specifications algorithms and data structures automata and formal languages computability among others.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
