Описание: Problems in Set Theory, Mathematical Logic and the Theory of Algorithms by I. Lavrov & L. Maksimova is an English translation of the fourth edition of the most popular student problem book in mathematical logic in Russian. It covers major classical topics in proof theory and the semantics of propositional and predicate logic as well as set theory and computation theory. Each chapter begins with 1-2 pages of terminology and definitions that make the book self-contained. Solutions are provided. The book is likely to become an essential part of curricula in logic.
Описание: This is a book about modelling, analysis and control of linear time- invariant systems. The book uses what is called the behavioral approach towards mathematical modelling. Thus a system is viewed as a dynamical relation between manifest and latent variables. The emphasis is on dynamical systems that are represented by systems of linear constant coefficients. In the first part of the book the structure of the set of trajectories that such dynamical systems generate is analyzed. Conditions are obtained for two systems of differential equations to be equivalent in the sense that they define the same behavior. It is further shown that the trajectories of such linear differential systems can be partitioned in free inputs and bound outputs. In addition the memory structure of the system is analyzed through state space models. The second part of the book is devoted to a number of important system properties, notably controllability, observability, and stability. An essential feature of using the behavioral approach is that it allows these and similar concepts to be introduced in a representation-free manner. In the third part control problems are considered, more specifically stabilization and pole placement questions. This text is suitable for advanced undergraduate or beginning graduate students in mathematics and engineering. It contains numerous exercises, including simulation problems, and examples, notably of mechanical systems and electrical circuits.
Автор: Sacks Название: Higher Recursion Theory ISBN: 1107168430 ISBN-13(EAN): 9781107168435 Издательство: Cambridge Academ Рейтинг: Цена: 12884 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the second publication in the Perspectives in Logic series, is an almost self-contained introduction to higher recursion theory, in which the reader is only assumed to know the basics of classical recursion theory. The book is divided into four parts: hyperarithmetic sets, metarecursion, ?-recursion, and E-recursion. This text is essential reading for all researchers in the field.
Автор: Fenstad Название: General Recursion Theory ISBN: 1107168163 ISBN-13(EAN): 9781107168169 Издательство: Cambridge Academ Рейтинг: Цена: 10929 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the tenth publication in the Perspectives in Logic series, Jens E. Fenstad takes an axiomatic approach to present a unified and coherent account of the many and various parts of general recursion theory. The main core of the book gives an account of the general theory of computations. The author then moves on to show how computation theories connect with and unify other parts of general recursion theory. Some mathematical maturity is required of the reader, who is assumed to have some acquaintance with recursion theory. This book is ideal for a second course in the subject.
Автор: Kechris Название: Ordinal Definability and Recursion Theory ISBN: 1107033403 ISBN-13(EAN): 9781107033405 Издательство: Cambridge Academ Рейтинг: Цена: 13920 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The proceedings of the Los Angeles Caltech-UCLA 'Cabal Seminar' were originally published in the 1970s and 1980s. Ordinal Definability and Recursion Theory is the third in a series of four books collecting the seminal papers from the original volumes together with extensive unpublished material, new papers on related topics and discussion of research developments since the publication of the original volumes. Focusing on the subjects of 'HOD and its Local Versions' (Part V) and 'Recursion Theory' (Part VI), each of the two sections is preceded by an introductory survey putting the papers into present context. These four volumes will be a necessary part of the book collection of every set theorist.
Автор: P. Odifreddi Название: Classical Recursion Theory, ISBN: 0444894837 ISBN-13(EAN): 9780444894830 Издательство: Elsevier Science Рейтинг: Цена: 7832 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Includes a number of applications to logic (in particular Godel`s theorems) and to computer science, for which Recursion Theory provides the theoretical foundation. This book presents a comprehensive reference for the subject starting from first principles.
Автор: P. Odifreddi Название: Classical Recursion Theory, Volume II, ISBN: 044450205X ISBN-13(EAN): 9780444502056 Издательство: Elsevier Science Рейтинг: Цена: 14944 р. Наличие на складе: Поставка под заказ.
Описание: Describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. This book presents a detailed picture of the computable sets from the perspective of theoretical computer science. It is suitable for those interested in complexity and computability theory.
Описание: A brief introduction to COMPILE, HERBY and THEO.- Predicate calculus, well-formed formulas and theorems.- COMPILE: transforming well-formed formulas to clauses.- Inference procedures.- Proving theorems by constructing closed semantic trees.- Resolution-refutation proofs.- HERBY: A semantic tree theorem prover.- Using HERBY.- THEO: A resolution-refutation theorem prover.- Using THEO.- A look at HERBY's source code.- A look at THEO's source code.- Other theorem provers.- References.
Описание: A mathematical introduction to the theory and applications of logic and set theory with an emphasis on writing proofs Highlighting the applications and notations of basic mathematical concepts within the framework of logic and set theory, A First Cou
Описание: The expression of uncertainty in measurement is a challenging aspect for researchers and engineers working in instrumentation and measurement because it involves physical, mathematical and philosophical issues. This problem is intensified by the limitations of the probabilistic approach used by the current standard (GUM).This text is the first to make full use of the mathematical theory of evidence to express the uncertainty in measurements. It gives an overview of the current standard, then pinpoints and constructively resolves its limitations through its unique approach. The text presents various tools for evaluating uncertainty, beginning with the probabilistic approach and concluding with the expression of uncertainty using random-fuzzy variables. The exposition is driven by numerous examples. The book is designed for immediate use and application in research and laboratory work.Apart from a classroom setting, this book can be used by practitioners in a variety of fields (including applied mathematics, applied probability, electrical and computer engineering, and experimental physics), and by such institutions as the IEEE, ISA, and National Institute of Standards and Technology.
Автор: Shoenfield Название: Recursion Theory ISBN: 1107168082 ISBN-13(EAN): 9781107168084 Издательство: Cambridge Academ Рейтинг: Цена: 10929 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the first publication in the Lecture Notes in Logic series, Shoenfield gives a clear and focused introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming one of the pillars on which modern computer science rests. This introduction is an ideal instrument for teaching and self-study that prepares the reader for the study of advanced monographs and the current literature on recursion theory.
Описание: S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recursion theory.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru