Enumerability · Decidability Computability, Hans Hermes; Gabor T. Herman; O. Plassmann

Автор: Sergei S. Goncharov
Название: Countable Boolean Algebras and Decidability
ISBN: 030611061X ISBN-13(EAN): 9780306110610
Издательство: Springer
Рейтинг:
Цена: 29209.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Describes the Russian research covering the structure and algorithmic properties of Boolean algebras from the algebraic and model-theoretic points of view. This text presents results as well as a selection of open questions on Boolean algebras. It features discussions of the Kottonen algebras in enrichments by ideals and automorphisms.

Автор: Gilles Dowek
Название: Proofs and Algorithms: Introduction to Logic and Computability Theory
ISBN: 0857291203 ISBN-13(EAN): 9780857291202
Издательство: Springer
Рейтинг:
Цена: 4884.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Автор: Cooper, S. Barry
Название: Computability theory
ISBN: 1584882379 ISBN-13(EAN): 9781584882374
Издательство: Taylor&Francis
Рейтинг:
Цена: 15312.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Offers an introduction to contemporary computability theory, techniques, and results. This book places the basic concepts and techniques of computability theory in their historical, philosophical and logical context. It includes a chapter that explores a variety of computability applications to mathematics and science.

Автор: J. Loeckx
Название: Computability and Decidability
ISBN: 3540058699 ISBN-13(EAN): 9783540058694
Издательство: Springer
Рейтинг:
Цена: 11173.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The present Lecture Notes evolved from a course given at the Technische Hogeschool Eindhoven and later at the Technische Hogeschool Twente. more specifically, their goal is to introduce the notions of computability and decidability, and to prepare for the study of automata theory, formal language theory and the theory of computing.

Автор: 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.

Автор: Rogers, H.
Название: Theory of recursive functions and effective computability /
ISBN: 0262680521 ISBN-13(EAN): 9780262680523
Издательство: MIT Press
Рейтинг:
Цена: 8465.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: (Reprint of the 1967 edition)