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.
Автор: 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.
Автор: 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.
Автор: 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.
Описание: 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.
Автор: Cook Название: Logical Foundations of Proof Complexity ISBN: 1107694116 ISBN-13(EAN): 9781107694118 Издательство: Cambridge Academ Рейтинг: Цена: 9186.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. The result is a uniform treatment of many systems in the literature.
Автор: Paulson Название: Logic and Computation ISBN: 0521395607 ISBN-13(EAN): 9780521395601 Издательство: Cambridge Academ Рейтинг: Цена: 8237.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A study of techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). The book is aimed at graduate students and researchers in theoretical computer science.
Автор: V??n?nen Название: Logic, Language, Information, and Computation ISBN: 3662529203 ISBN-13(EAN): 9783662529201 Издательство: Springer Рейтинг: Цена: 8944.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 23rd Workshop on Logic, Language, Information and Communication, WoLLIC 2016, held in Puebla, Mexico, in August 2016.
The 23 contributed papers, presented together with 9 invited lectures and tutorials, were carefully reviewed and selected from 33 submissions. The focus of the workshop is to provide a forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning.
Автор: Vasco Brattka, Hannes Diener, Dieter Spreen Название: Logic, Computation, Hierarchies ISBN: 1614517835 ISBN-13(EAN): 9781614517832 Издательство: Walter de Gruyter Цена: 23049.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Published in honor of Victor L. Selivanov, the 17 articles collected in this volume inform on the latest developments in computability theory and its applications in computable analysis; descriptive set theory and topology; and the theory of omega-languages; as well as non-classical logics, such as temporal logic and paraconsistent logic. This volume will be of interest to mathematicians and logicians, as well as theoretical computer scientists.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
