Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Cертификаты | Хиты | | |
 

Introduction to Boolean Algebras, Steven Givant; Paul Halmos



Варианты приобретения
Цена: 4961р.
Кол-во:
 о цене
Наличие: Отсутствует. Возможна поставка под заказ.

При оформлении заказа до: 30 авг 2022
Ориентировочная дата поставки: конец Сентября- начало Октября
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Steven Givant; Paul Halmos
Название:  Introduction to Boolean Algebras
ISBN: 9780387402932
Издательство: Springer
Классификация:
ISBN-10: 0387402934
Обложка/Формат: Hardback
Страницы: 585
Вес: 1.122 кг.
Дата издания: 2009/02/01
Серия: Undergraduate Texts in Mathematics
Язык: English
Издание: 2 rev ed
Иллюстрации: 10 black & white illustrations, 5 black & white ha
Размер: 166 x 243 x 37
Читательская аудитория: Professional & vocational
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии



Schaum`s outline of Boolean algebra and switching circuits

Автор: Mendelson, Elliot,
Название: Schaum`s outline of Boolean algebra and switching circuits
ISBN: 0070414602 ISBN-13(EAN): 9780070414600
Издательство: McGraw-Hill
Рейтинг:
Цена: 2474 р.
Наличие на складе: Есть (5 шт.)
Описание: Contains 150 problems with solutions; explanations of theory and applications; coverage of the material in Boolean algebra courses; a solved-problem approach that teaches with hands-on help; and exercises for improving problem-solving skills.

Boolean Functions and Computation Models

Автор: Clote Peter, Kranakis Evangelos
Название: Boolean Functions and Computation Models
ISBN: 3540594361 ISBN-13(EAN): 9783540594369
Издательство: Springer
Рейтинг:
Цена: 8657 р.
Наличие на складе: Поставка под заказ.

Описание: This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Nonuniform computation models are studied in the form of boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. The book will benefit advanced undergraduates and graduate students as well as researchers in the field of complexity theory.

Complexity Classifications of Boolean Constraint Satisfaction Problems

Автор: Nadia Creignou
Название: Complexity Classifications of Boolean Constraint Satisfaction Problems
ISBN: 0898714796 ISBN-13(EAN): 9780898714791
Издательство: Eurospan
Рейтинг:
Цена: 11504 р.
Наличие на складе: Поставка под заказ.

Описание: Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal is to develop a framework for classifying the complexity of Boolean CSP in a uniform way. In doing so, they bring out common themes underlying many concepts and results in both algorithms and complexity theory. The results and techniques presented here show that Boolean CSP provide an excellent framework for discovering and formally validating 'global' inferences about the nature of computation. This book presents a novel and compact form of a compendium that classifies an infinite number of problems by using a rule-based approach. This enables practitioners to determine whether or not a given problem is known to be computationally intractable.

Boolean Function Complexity

Автор: Paterson
Название: Boolean Function Complexity
ISBN: 0521408261 ISBN-13(EAN): 9780521408264
Издательство: Cambridge Academ
Рейтинг:
Цена: 4107 р.
Наличие на складе: Поставка под заказ.

Описание: By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase.

An Introduction to Lie Groups and Lie Algebras

Автор: Alexander Kirillov, Jr
Название: An Introduction to Lie Groups and Lie Algebras
ISBN: 0521889693 ISBN-13(EAN): 9780521889698
Издательство: Cambridge Academ
Рейтинг:
Цена: 9722 р.
Наличие на складе: Поставка под заказ.

Описание: With roots in the nineteenth century, Lie theory has since found many and varied applications in mathematics and mathematical physics, to the point where it is now regarded as a classical branch of mathematics in its own right. This graduate text focuses on the study of semisimple Lie algebras, developing the necessary theory along the way. The material covered ranges from basic definitions of Lie groups to the classification of finite-dimensional representations of semisimple Lie algebras. Written in an informal style, this is a contemporary introduction to the subject which emphasizes the main concepts of the proofs and outlines the necessary technical details, allowing the material to be conveyed concisely. Based on a lecture course given by the author at the State University of New York at Stony Brook, the book includes numerous exercises and worked examples and is ideal for graduate courses on Lie groups and Lie algebras.

An Introduction to K-Theory for C*-Algebras

Автор: M. R?rdam
Название: An Introduction to K-Theory for C*-Algebras
ISBN: 0521783348 ISBN-13(EAN): 9780521783347
Издательство: Cambridge Academ
Рейтинг:
Цена: 14380 р.
Наличие на складе: Поставка под заказ.

Описание: Over the last 25 years K-theory has become an integrated part of the study of C*-algebras. This book gives an elementary introduction to this interesting and rapidly growing area of mathematics. Fundamental to K-theory is the association of a pair of Abelian groups, K0(A) and K1(A), to each C*-algebra A. These groups reflect the properties of A in many ways. This book covers the basic properties of the functors K0 and K1 and their interrelationship. Applications of the theory include Elliott’s classification theorem for AF-algebras, and it is shown that each pair of countable Abelian groups arises as the K-groups of some C*-algebra. The theory is well illustrated with 120 exercises and examples, making the book ideal for beginning graduate students working in functional analysis, especially operator algebras, and for researchers from other areas of mathematics who want to learn about this subject.

Clifford Algebras: An Introduction

Автор: Garling
Название: Clifford Algebras: An Introduction
ISBN: 1107422191 ISBN-13(EAN): 9781107422193
Издательство: Cambridge Academ
Рейтинг:
Цена: 4929 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A straightforward introduction to Clifford algebras, providing the necessary background material and many applications in mathematics and physics.

Information Algebras / Generic Structures for Inference

Автор: Kohlas JГјrg
Название: Information Algebras / Generic Structures for Inference
ISBN: 1852336897 ISBN-13(EAN): 9781852336899
Издательство: Springer
Рейтинг:
Цена: 13859 р.
Наличие на складе: Поставка под заказ.

Описание: Information usually comes in pieces, from different sources. It refers to different, but related questions. Therefore information needs to be aggregated and focused onto the relevant questions. Considering combination and focusing of information as the relevant operations leads to a generic algebraic structure for information. This book introduces and studies information from this algebraic point of view. Algebras of information provide the necessary abstract framework for generic inference procedures. They allow the application of these procedures to a large variety of different formalisms for representing information. At the same time they permit a generic study of conditional independence, a property considered as fundamental for knowledge presentation. Information algebras provide a natural framework to define and study uncertain information. Uncertain information is represented by random variables that naturally form information algebras. This theory also relates to probabilistic assumption-based reasoning in information systems and is the basis for the belief functions in the Dempster-Shafer theory of evidence.

From Boolean Logic to Switching Circuits and Automata

Автор: Stankovic
Название: From Boolean Logic to Switching Circuits and Automata
ISBN: 3642116817 ISBN-13(EAN): 9783642116810
Издательство: Springer
Рейтинг:
Цена: 18349 р.
Наличие на складе: Поставка под заказ.

Описание: Logic networks and automata are facets of digital systems. The change of  the design of logic networks from skills and art into a scientific discipline was possible by the development of the  underlying mathematical theory called the Switching Theory. The fundamentals of this theory come from the attempts towards an algebraic description of laws of thoughts presented  in the works by George J. Boole and  the works on logic by Augustus De Morgan. As often the case in engineering, when the importance of a problem and the need for solving it reach certain limits, the solutions are searched by many scholars in different parts of the word, simultaneously or at about the same time, however, quite independently and often unaware of  the work by other scholars. The formulation and rise of Switching Theory is such an example.  This book  presents a brief account of the developments of Switching Theory and highlights some less known facts in the history of it.  The readers will find the book a fresh look into the development of the field revealing how difficult it has been to arrive at many of the concepts that we now consider obvious . Researchers in the history or philosophy of computing will find this book a valuable source of information that complements the standard presentations of the topic.   

Clifford Algebras: An Introduction

Автор: Garling
Название: Clifford Algebras: An Introduction
ISBN: 1107096383 ISBN-13(EAN): 9781107096387
Издательство: Cambridge Academ
Рейтинг:
Цена: 13694 р.
Наличие на складе: Поставка под заказ.

Описание: A straightforward introduction to Clifford algebras, providing the necessary background material and many applications in mathematics and physics.

THE SATISFIABILITY PROBLEM & BOOLEAN FUNCTIONS   TDM

Автор: FRANCO
Название: THE SATISFIABILITY PROBLEM & BOOLEAN FUNCTIONS TDM
ISBN: 0444504109 ISBN-13(EAN): 9780444504104
Издательство: Elsevier Science
Рейтинг:
Цена: 26790 р.
Наличие на складе: Поставка под заказ.

Cardinal invariants on boolean algebras

Автор: Monk
Название: Cardinal invariants on boolean algebras
ISBN: 3034603339 ISBN-13(EAN): 9783034603331
Издательство: Springer
Рейтинг:
Цена: 6929 р.
Наличие на складе: Поставка под заказ.

Описание: This text covers cardinal number valued functions defined for any Boolean algebra such as cellularity. It explores the behavior of these functions under algebraic operations such as products, free products, ultraproducts and their relationships to each other.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия