Описание: 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.
Автор: 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.
Автор: Arnold Beckmann; Victor Mitrana; Mariya Soskova Название: Evolving Computability ISBN: 3319200275 ISBN-13(EAN): 9783319200279 Издательство: Springer Рейтинг: Цена: 8944.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 11th Conference on Computability in Europe, CiE 2015, held in Bucharest, Romania, in June/July 2015. The 26 revised papers presented were carefully reviewed and selected from 64 submissions and included together with 10 invited papers in this proceedings.
Автор: Rogers, H. Название: Theory of recursive functions and effective computability / ISBN: 0262680521 ISBN-13(EAN): 9780262680523 Издательство: MIT Press Рейтинг: Цена: 8465.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: (Reprint of the 1967 edition)
Автор: Hans Hermes; Gabor T. Herman; O. Plassmann Название: Enumerability · Decidability Computability ISBN: 3642461808 ISBN-13(EAN): 9783642461804 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: If we grant the legitimacy of the suggested precise replacements of the concept of algorithm and related concepts, then we can say that the mathematicians have shown by strictly mathematical methods that there exist mathematical problems which cannot be dealt with by the methods of calculating mathematics.
Автор: 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.
Автор: 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.
Автор: Douglas S. Bridges Название: Computability ISBN: 1461269253 ISBN-13(EAN): 9781461269250 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Barry S. Cooper; Sergei S. Goncharov Название: Computability and Models ISBN: 1461352258 ISBN-13(EAN): 9781461352259 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: There are also articles concerned with the computability of aspects of familiar mathematical structures, and - a return to the sort of basic underlying questions considered by Alan Turing in the early days of the subject - an article giving a new perspective on computability in the real world.
Автор: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
