Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7 707 857-29-98
  +7(7172) 65-23-70
  10:00-18:00 пн-пт
  shop@logobook.kz
   
    Поиск книг                        
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Бестселлеры | |
 

Recursion Theory: Computational Aspects of Definability, Chi Tat Chong, Liang Yu


Варианты приобретения
Цена: 138080.00T
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: 172 шт.  
При оформлении заказа до:
Ориентировочная дата поставки:
При условии наличия книги у поставщика.

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

Автор: Chi Tat Chong, Liang Yu
Название:  Recursion Theory: Computational Aspects of Definability
Перевод названия: Чи Тат Чонг: Теория рекурсии. Вычислительный аспект определенности
ISBN: 9783110275551
Издательство: Walter de Gruyter
Классификация:



ISBN-10: 3110275554
Обложка/Формат: Hardback
Страницы: 320
Вес: 0.71 кг.
Дата издания: 30.07.2015
Серия: Mathematics
Язык: English
Размер: 244 x 170 x 19
Читательская аудитория: Professional and scholarly
Ключевые слова: Mathematical foundations,Applied mathematics,Computer science, COMPUTERS / Computer Science,COMPUTERS / Information Theory,MATHEMATICS / Applied
Основная тема: MATHEMATICS / Applied,COMPUTERS / Computer Science
Ссылка на Издательство: Link
Поставляется из: Германии
Описание: 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.

Larisa Maksimova on Implication, Interpolation, and Definability

Автор: Sergei Odintsov
Название: Larisa Maksimova on Implication, Interpolation, and Definability
ISBN: 3319699164 ISBN-13(EAN): 9783319699165
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Chapter 1. Sergei Odintsov, Maksimova, Relevance and the Study of Lattices of Non-classical Logics

Chapter 2. Larisa Maksimova, A Short Scientific Autobiography

Chapter 3. Katalin Bimbo and J. Michael Dunn, Larisa Maksimova's Early Contributions to Relevance Logic

Chapter 4. Lev Beklemishev, A Note on Strictly Positive Logics and Word Rewriting Systems

Chapter 5. Alex Citkin, Characteristic Formulas over Intermediate Logics

Chapter 6. Alex Citkin, Criterion of Generelazed Disjunction Property

Chapter 7. Janusz Czelakowski, Rasiowa-Sikorski Sets and Forsing

Chapter 8. Giovanna D'Agostino, -Levels of Interpolation

Chapter 9. Anastasia Karpenko, Decidability of Interpolation Properties for Weakly Transitive Modal Logics

Chapter 10. Alexei Muravitski, Lattice NExtS4 from the Embedding Theorem Viewpoint

Chapter 11. Vladimir Rybakov, Linear Temporal Logic with Non-Transitive Time, Algorithms for Decidability and Verification of Admissibility

Chapter 12. Dmitry Tishkovsky, On Algebraisation of Superintuitionistic Predicate Logics

Chapter 13. Valentin Shehtman, Segerberg Squares of Modal Logics and Theories of Relation Algebras

Chapter 14. Aleksandr Yashin, Dummett Logic, Irreflexive Modality, and Novikov Completeness

Chapter 15. Veta Yun, On Linear Logic of Knowledge and Time

Appendix: A Complete List of Larisa Maximova's Publications


Ordinal Definability and Recursion Theory

Автор: Kechris
Название: Ordinal Definability and Recursion Theory
ISBN: 1107033403 ISBN-13(EAN): 9781107033405
Издательство: Cambridge Academ
Рейтинг:
Цена: 174240.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Ordinal Definability and Recursion Theory is the third in a series of four books presenting the seminal papers from the Caltech-UCLA `Cabal Seminar` with extensive unpublished material, new papers on related topics, and discussion of research developments since the publication of the original volumes.

Recursive Macroeconomic Theory, 3 ed.

Автор: Ljungqvist, Lars, Sargent, Thomas J
Название: Recursive Macroeconomic Theory, 3 ed.
ISBN: 0262018748 ISBN-13(EAN): 9780262018746
Издательство: MIT Press
Рейтинг:
Цена: 78340.00 T
Наличие на складе: Невозможна поставка.
Описание:

A substantially revised new edition of a widely used text, offering both an introduction to recursive methods and advanced material.

Recursive methods offer a powerful approach for characterizing and solving complicated problems in dynamic macroeconomics. Recursive Macroeconomic Theory provides both an introduction to recursive methods and advanced material, mixing tools and sample applications. Only experience in solving practical problems fully conveys the power of the recursive approach, and the book provides many applications. This third edition offers substantial new material, with three entirely new chapters and significant revisions to others. The new content reflects recent developments in the field, further illustrating the power and pervasiveness of recursive methods.

New chapters cover asset pricing empirics with possible resolutions to puzzles; analysis of credible government policy that entails state variables other than reputation; and foundations of aggregate labor supply with time averaging replacing employment lotteries. Other new material includes a multi-country analysis of taxation in a growth model, elaborations of the fiscal theory of the price level, and age externalities in a matching model.

The book is suitable for both first- and second-year graduate courses in macroeconomics and monetary economics. Most chapters conclude with exercises. Many exercises and examples use Matlab programs, which are cited in a special index at the end of the book.


Definitions and Definability: Philosophical Perspectives

Автор: J.H. Fetzer; D. Shatz; G. Schlesinger
Название: Definitions and Definability: Philosophical Perspectives
ISBN: 9401054789 ISBN-13(EAN): 9789401054782
Издательство: Springer
Рейтинг:
Цена: 139750.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Definability and computability /

Автор: Ershov, I?U?rii? Leonidovich.
Название: Definability and computability /
ISBN: 0306110393 ISBN-13(EAN): 9780306110399
Издательство: Springer
Рейтинг:
Цена: 213360.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: In this book, Yurii L. Ershov posits the view that computability-in the broadest sense-can be regarded as the Sigma-definability in the suitable sets. He presents a new approach to providing the G del incompleteness theorem based on systematic use of the formulas with the restricted quantifiers. The volume also includes a novel exposition on the foundations of the theory of admissible sets with urelements, using the Gandy theorem throughout the theory's development. Other topics discussed are forcing, Sigma-definability, dynamic logic, and Sigma-predicates of finite types.

Definitions and Definability: Philosophical Perspectives

Автор: J.H. Fetzer; D. Shatz; G. Schlesinger
Название: Definitions and Definability: Philosophical Perspectives
ISBN: 0792310462 ISBN-13(EAN): 9780792310464
Издательство: Springer
Рейтинг:
Цена: 186290.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Higher Recursion Theory

Автор: Sacks
Название: Higher Recursion Theory
ISBN: 1107168430 ISBN-13(EAN): 9781107168435
Издательство: Cambridge Academ
Рейтинг:
Цена: 143610.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This introduction to higher recursion theory is essential reading for all researchers in the field. It is divided into four parts: hyperarithmetic sets, metarecursion, -recursion, and E-recursion.

Recursion-Theoretic Hierarchies

Автор: Hinman
Название: Recursion-Theoretic Hierarchies
ISBN: 1107168244 ISBN-13(EAN): 9781107168244
Издательство: Cambridge Academ
Рейтинг:
Цена: 159450.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Recursion Theory Week

Автор: Heinz-Dieter Ebbinghaus; Gert H. M?ller; Gerald E.
Название: Recursion Theory Week
ISBN: 3540156739 ISBN-13(EAN): 9783540156734
Издательство: Springer
Рейтинг:
Цена: 46540.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Recursion Theory

Автор: Shoenfield
Название: Recursion Theory
ISBN: 1107168082 ISBN-13(EAN): 9781107168084
Издательство: Cambridge Academ
Рейтинг:
Цена: 116160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Techniques of Admissible Recursion Theory

Автор: C. T. Chong
Название: Techniques of Admissible Recursion Theory
ISBN: 3540139028 ISBN-13(EAN): 9783540139027
Издательство: Springer
Рейтинг:
Цена: 41920.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Recursion Theory Week

Автор: Klaus Ambos-Spies; Gert H. M?ller; Gerald E. Sacks
Название: Recursion Theory Week
ISBN: 3540527729 ISBN-13(EAN): 9783540527725
Издательство: Springer
Рейтинг:
Цена: 32560.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These proceedings contain research and survey papers on recursion theory, with emphasis on degree theory, computational complexity theory, generalized recursion theory and recursive mathematics.


Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2)
ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
Kaspi QR
   В Контакте     В Контакте Мед  Мобильная версия