Techniques of Admissible Recursion Theory, C. T. Chong

Автор: Barwise
Название: Admissible Sets and Structures
ISBN: 1107168333 ISBN-13(EAN): 9781107168336
Издательство: Cambridge Academ
Рейтинг:
Цена: 141510.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Admissible set theory is a major source of interaction between model theory, recursion theory and set theory. This volume presents the basic facts about admissible sets and admissible ordinals in a way that makes them accessible to logic students and specialists alike.

Автор: 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.

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

Автор: 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.

Автор: H.C. Myung
Название: Malcev-Admissible Algebras
ISBN: 1489966633 ISBN-13(EAN): 9781489966636
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: 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.

Автор: Fenstad
Название: General Recursion Theory
ISBN: 1107168163 ISBN-13(EAN): 9781107168169
Издательство: Cambridge Academ
Рейтинг:
Цена: 121440.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume presents a unified and coherent account of general recursion theory. The main core of the book gives an account of the general theory of computations, then the author moves on to show how computation theories connect and unify other parts of recursion theory.

Автор: William Levine; Georgia Martin
Название: Bounded Queries in Recursion Theory
ISBN: 1461268486 ISBN-13(EAN): 9781461268482
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it.

Автор: 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.

Автор: 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.

Автор: 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.