Описание: Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, G?del’s incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself.Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.
Описание: Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.
Описание: This book presents a set of historical recollections on the work of Martin Davis and his role in advancing our understanding of the connections between logic, computing, and unsolvability.
Автор: George S. Boolos Название: Computability and logic ISBN: 0521701465 ISBN-13(EAN): 9780521701464 Издательство: Cambridge Academ Рейтинг: Цена: 5069.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, but also a large number of optional topics, from Turing`s theory of computability to Ramsey`s theorem. This fifth edition was first published in 2007.
Автор: Adam Day; Michael Fellows; Noam Greenberg; Bakhady Название: Computability and Complexity ISBN: 3319500619 ISBN-13(EAN): 9783319500614 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The volume contains 42 papers presenting original unpublished research, or expository and survey results in Turing degrees, computably enumerable sets, computable algebra, computable model theory, algorithmic randomness, reverse mathematics, and parameterized complexity, all areas in which Rod Downey has had significant interests and influence.
Автор: Pour-El Название: Computability in Analysis and Physics ISBN: 1107168449 ISBN-13(EAN): 9781107168442 Издательство: Cambridge Academ Рейтинг: Цена: 18216.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is the first graduate-level treatment of computable analysis within the tradition of classical mathematical reasoning. The authors are concerned with the computability or noncomputability of standard processes in analysis and physics. The book is self-contained and serves well as an introduction to research in this area.
Автор: John Longley; Dag Normann Название: Higher-Order Computability ISBN: 3662479915 ISBN-13(EAN): 9783662479919 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book offers a self-contained exposition of the theory of computability in a higher-order context, where `computable operations` may themselves be passed as arguments to other computable operations.
Автор: John Longley; Dag Normann Название: Higher-Order Computability ISBN: 3662517116 ISBN-13(EAN): 9783662517116 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book offers a self-contained exposition of the theory of computability in a higher-order context, where `computable operations` may themselves be passed as arguments to other computable operations.
Автор: Ershov, I?U?rii? Leonidovich. Название: Definability and computability / ISBN: 0306110393 ISBN-13(EAN): 9780306110399 Издательство: Springer Рейтинг: Цена: 32004.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: In this book, Yurii L. Ershov posits the view that computability-in the broadest sense-can be regarded as the Sigma-definability in the suitable sets. He presents a new approach to providing the G del incompleteness theorem based on systematic use of the formulas with the restricted quantifiers. The volume also includes a novel exposition on the foundations of the theory of admissible sets with urelements, using the Gandy theorem throughout the theory's development. Other topics discussed are forcing, Sigma-definability, dynamic logic, and Sigma-predicates of finite types.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
