Logic, Construction, Computation, Ulrich Berger, Hannes Diener, Peter Schuster, Monika Seisenberger

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

Автор: Petr Hajek
Название: Metamathematics of First-Order Arithmetic
ISBN: 1107168414 ISBN-13(EAN): 9781107168411
Издательство: Cambridge Academ
Рейтинг:
Цена: 16743.00 р. 23918.00 -30%
Наличие на складе: Есть (1 шт.)
Описание: This much-needed monograph on the metamathematics of first-order arithmetic pays particular attention to subsystems (fragments) of Peano arithmetic and gives the reader a deeper understanding of the role of the axiom schema of induction and of the phenomenon of incompleteness.

Автор: Oikkonen
Название: Logic Colloquium `90
ISBN: 110716902X ISBN-13(EAN): 9781107169029
Издательство: Cambridge Academ
Рейтинг:
Цена: 17424.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The proceedings of the Association for Symbolic Logic meeting held in Helsinki, Finland, in July 1990, containing eighteen papers written by leading researchers in logic. Between them they cover all fields of mathematical logic, including model theory, proof theory, recursion theory, and set theory.

Автор: Larrazabal
Название: Logic Colloquium `96
ISBN: 110716608X ISBN-13(EAN): 9781107166080
Издательство: Cambridge Academ
Рейтинг:
Цена: 17424.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume presents the proceedings of the 1996 European Summer Meeting of the Association for Symbolic Logic, held in San Sebastian, Spain. The main topics were model theory, proof theory, recursion and complexity theory, models of arithmetic, logic for artificial intelligence, formal semantics of natural language, and philosophy of contemporary logic.

Автор: Shoenfield
Название: Recursion Theory
ISBN: 1107168082 ISBN-13(EAN): 9781107168084
Издательство: Cambridge Academ
Рейтинг:
Цена: 17424.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: An introduction to recursion theory that will prepare the reader for the study of advanced monographs and the current literature on the topic. The clarity and focus of this text makes it an ideal instrument for teaching and self-study.

Автор: J.-J. Ch. Meyer, W. van der Hoek
Название: Epistemic Logic for AI and Computer Science
ISBN: 0521602807 ISBN-13(EAN): 9780521602808
Издательство: Cambridge Academ
Рейтинг:
Цена: 9186.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book, based on courses taught at universities and summer schools, provides a broad introduction to the subject; many exercises are included with their solutions.

Автор: Hinman
Название: Recursion-Theoretic Hierarchies
ISBN: 1107168244 ISBN-13(EAN): 9781107168244
Издательство: Cambridge Academ
Рейтинг:
Цена: 23918.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The theory set out in this volume is the result of the meeting and common development of two currents of mathematical research: descriptive set theory and recursion theory. The author develops a general theory from which the results of both areas can be derived, making the common themes clear.

Автор: Stoyan Mihov, Klaus U. Schulz
Название: Finite-State Techniques: Automata, Transducers and Bimachines
ISBN: 1108485413 ISBN-13(EAN): 9781108485418
Издательство: Cambridge Academ
Рейтинг:
Цена: 10611.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This text for graduate students and researchers gives a complete coverage of the field with mathematical rigour, from basics to advanced topics. It closes the gap between theory and real practice by providing full proofs and executable code for all algorithms, showcasing the efficient and elegant solutions that finite-state methods offer.

Автор: Yiannis N. Moschovakis
Название: Abstract Recursion and Intrinsic Complexity
ISBN: 110841558X ISBN-13(EAN): 9781108415583
Издательство: Cambridge Academ
Рейтинг:
Цена: 18216.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes an accessible introduction to abstract recursion theory and contains over 250 problems.

Автор: Paola Bonizzoni; Vasco Brattka; Benedikt L?we
Название: The Nature of Computation: Logic, Algorithms, Applications
ISBN: 3642390528 ISBN-13(EAN): 9783642390524
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 9th Conference on Computability in Europe, CiE 2013, held in Milan, Italy, in July 2013.

Автор: Bob Coecke; Luke Ong; Prakash Panangaden
Название: Computation, Logic, Games, and Quantum Foundations - The Many Facets of Samson Abramsky
ISBN: 3642381634 ISBN-13(EAN): 9783642381638
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Published in honor of the 60th birthday of Samson Abramsky, this book offers contributions by some of his colleagues, former students and friends, representing his manifold contributions to the disciplines of semantics, logic, games and quantum mechanics.

Автор: Walton
Название: Goal-based Reasoning for Argumentation
ISBN: 1107119049 ISBN-13(EAN): 9781107119048
Издательство: Cambridge Academ
Рейтинг:
Цена: 12670.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Practical argumentation is intelligent reasoning from an agent`s goals and known circumstances, and from an action selected as a means, to arrive at a decision on what action to take. This book will appeal to a wide audience, from designers of multi-agent and robotics systems to social scientists.