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

Relations : concrete, abstract, and applied :, Toth, Herbert,



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

При оформлении заказа до: 7 фев 2023
Ориентировочная дата поставки: конец Марта
При условии наличия книги у поставщика.

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

Автор: Toth, Herbert,   (Герберт Тот)
Название:  Relations : concrete, abstract, and applied :
Перевод названия: Герберт Тот: Отношения. Конкретные, абстрактные и прикладные
ISBN: 9789811220340
Издательство: World Scientific Publishing
Классификация:
ISBN-10: 9811220344
Обложка/Формат: Hardback
Страницы: 572
Вес: 1.105 кг.
Дата издания: 29.07.2020
Серия: Mathematics
Язык: English
Размер: 24.41 x 16.99 x 3.18 cm
Читательская аудитория: College/higher education
Ключевые слова: Mathematical logic, MATHEMATICS / Algebra / Abstract,MATHEMATICS / Discrete Mathematics,MATHEMATICS / Logic
Рейтинг:
Поставляется из: Англии



Mathematical Methods in Engineering

Автор: Powers, Joseph M. (University of Notre Dame, Indiana) Sen, Mihir (University of Notre Dame, Indiana)
Название: Mathematical Methods in Engineering
ISBN: 1107037042 ISBN-13(EAN): 9781107037045
Издательство: Cambridge Academ
Рейтинг:
Цена: 10295 р.
Наличие на складе: Поставка под заказ.

Описание: This text focuses on a variety of topics in mathematics in common usage in graduate engineering programs including vector calculus, linear and nonlinear ordinary differential equations, approximation methods, vector spaces, linear algebra, integral equations and dynamical systems. The book is designed for engineering graduate students who wonder how much of their basic mathematics will be of use in practice. Following development of the underlying analysis, the book takes students through a large number of examples that have been worked in detail. Students can choose to go through each step or to skip ahead if they so desire. After seeing all the intermediate steps, they will be in a better position to know what is expected of them when solving assignments, examination problems, and when on the job. Chapters conclude with exercises for the student that reinforce the chapter content and help connect the subject matter to a variety of engineering problems. Students have grown up with computer-based tools including numerical calculations and computer graphics; the worked-out examples as well as the end-of-chapter exercises often use computers for numerical and symbolic computations and for graphical display of the results.

Goguen Categories / A Categorical Approach to L-fuzzy Relations

Автор: Winter Michael
Название: Goguen Categories / A Categorical Approach to L-fuzzy Relations
ISBN: 1402061633 ISBN-13(EAN): 9781402061639
Издательство: Springer
Рейтинг:
Цена: 17967 р.
Наличие на складе: Поставка под заказ.

Описание: Goguen categories extend the relational calculus and its categorical formalization to the fuzzy world. Starting from the fundamental concepts of sets, binary relations and lattices this book introduces several categorical formulations of an abstract theory of relations such as allegories, Dedekind categories and related structures. It is shown that neither theory is sufficiently rich to describe basic operations on fuzzy relations. The book then introduces Goguen categories and provides a comprehensive study of these structures including their representation theory, and the definability of norm-based operations.The power of the theory is demonstrated by a comprehensive example. A certain Goguen category is used to specify and to develop a fuzzy controller. Based on its abstract description as well as certain desirable properties and their formal proofs, a verified controller is derived without compromising the - sometimes - intuitive choice of norm-based operations by fuzzy engineers.

Learning to Reason: An Introduction to Logic, Sets, and Relations

Автор: Nancy Rodgers
Название: Learning to Reason: An Introduction to Logic, Sets, and Relations
ISBN: 047137122X ISBN-13(EAN): 9780471371229
Издательство: Wiley
Рейтинг:
Цена: 20064 р.
Наличие на складе: Поставка под заказ.

Описание: Dispelling the notion that mathematics is about doing computations, Nancy Rodgers shows how to view mathematics as the source for meaningful structures and relations that can be supported with logical reasoning. She proceeds to show readers in an easy-to-follow, friendly style how to improve their reasoning skills as well as the ability to read and write mathemats and symbolic languages.

Fuzzy Decision Procedures with Binary Relations

Автор: Leonid Kitainik
Название: Fuzzy Decision Procedures with Binary Relations
ISBN: 079232367X ISBN-13(EAN): 9780792323679
Издательство: Springer
Рейтинг:
Цена: 25036 р.
Наличие на складе: Поставка под заказ.

Описание: In decision theory there are basically two appr~hes to the modeling of individual choice: one is based on an absolute representation of preferences leading to a ntDnerical expression of preference intensity.

Abstract Algebraic Logic. an Introductory Textbook

Автор: Font Josep Maria
Название: Abstract Algebraic Logic. an Introductory Textbook
ISBN: 1848902077 ISBN-13(EAN): 9781848902077
Издательство: Неизвестно
Цена: 5382 р.
Наличие на складе: Поставка под заказ.

Theory of Relations,145

Автор: R. Fraisse
Название: Theory of Relations,145
ISBN: 0444505423 ISBN-13(EAN): 9780444505422
Издательство: Elsevier Science
Рейтинг:
Цена: 18785 р.
Наличие на складе: Поставка под заказ.

Описание: Covers relation theory, from origins (Hausdorff 1914, Sierpinski 1928) to classical results (Frasnay 1965, Laver 1968, Pouzet 1981). This book exposes the results in axiomatic set theory. It allows us, for each statement, to specify if it is proved only from ZF axioms of choice, the continuum hypothesis or only the ultrafilter axiom.

Relations and Graphs

Автор: Gunther Schmidt; Thomas Str?hlein
Название: Relations and Graphs
ISBN: 3642779700 ISBN-13(EAN): 9783642779701
Издательство: Springer
Рейтинг:
Цена: 15572 р.
Наличие на складе: Поставка под заказ.

Описание: Relational methods can be found at various places incomputer science, notably in data base theory, relationalsemantics of concurrency, relationaltype theory, analysisof rewriting systems, and modern programming languagedesign. Itexplains how to use relational and graph-theoretic methodssystematically in computer science.

Applying Soft Computing in Defining Spatial Relations

Автор: Pascal Matsakis; Les M. Sztandera
Название: Applying Soft Computing in Defining Spatial Relations
ISBN: 3662002949 ISBN-13(EAN): 9783662002940
Издательство: Springer
Рейтинг:
Цена: 13176 р.
Наличие на складе: Поставка под заказ.

Fuzzy Decision Procedures with Binary Relations

Автор: Leonid Kitainik
Название: Fuzzy Decision Procedures with Binary Relations
ISBN: 9401048665 ISBN-13(EAN): 9789401048668
Издательство: Springer
Рейтинг:
Цена: 25036 р.
Наличие на складе: Поставка под заказ.

Описание: In decision theory there are basically two appr~hes to the modeling of individual choice: one is based on an absolute representation of preferences leading to a ntDnerical expression of preference intensity.

Degree Spectra of Relations on a Cone

Автор: Matthew Harrison-Trainor
Название: Degree Spectra of Relations on a Cone
ISBN: 1470428393 ISBN-13(EAN): 9781470428396
Издательство: Eurospan
Рейтинг:
Цена: 11642 р.
Наличие на складе: Поставка под заказ.

Описание: Let $\mathcal A$ be a mathematical structure with an additional relation $R$. The author is interested in the degree spectrum of $R$, either among computable copies of $\mathcal A$ when $(\mathcal A,R)$ is a ``natural'' structure, or (to make this rigorous) among copies of $(\mathcal A,R)$ computable in a large degree d. He introduces the partial order of degree spectra on a cone and begin the study of these objects. Using a result of Harizanov--that, assuming an effectiveness condition on $\mathcal A$ and $R$, if $R$ is not intrinsically computable, then its degree spectrum contains all c.e. degrees--the author shows that there is a minimal non-trivial degree spectrum on a cone, consisting of the c.e. degrees.

Recursion Theory: Computational Aspects of Definability

Автор: Chi Tat Chong, Liang Yu
Название: Recursion Theory: Computational Aspects of Definability
ISBN: 3110275554 ISBN-13(EAN): 9783110275551
Издательство: Walter de Gruyter
Цена: 17753 р.
Наличие на складе: Нет в наличии.

Описание: This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory.The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.

Introduction to Languages, Machines and Logic / Computable Languages, Abstract Machines and Formal Logic

Автор: Parkes Alan P.
Название: Introduction to Languages, Machines and Logic / Computable Languages, Abstract Machines and Formal Logic
ISBN: 1852334649 ISBN-13(EAN): 9781852334642
Издательство: Springer
Рейтинг:
Цена: 8379 р.
Наличие на складе: Поставка под заказ.

Описание: This book provides an accessible introduction to the most important features of formal languages and automata theory - core topics on computer science degree schemes worldwide. It focuses on the key concepts, illustrating potentially intimidating material through diagrams and pictorial representations, and this edition will include new and expanded coverage of topics such as: reduction and simplification of material on Turing machines; complexity and O notation; propositional logic and first order predicate logic. Aimed primarily at computer scientists rather than mathematicians, algorithms and proofs are presented informally through examples, and there are numerous exercises (many with solutions) and an extensive glossary. This book will be invaluable to students of computer science but it will also prove essential reading to all practitioners needing to know about formal methods.


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