E-Recursion, Forcing And C*-Algebras, Chong Chitat Et Al

Автор: Mattesi, Mike
Название: Force: character design from life drawing
ISBN: 0240809939 ISBN-13(EAN): 9780240809939
Издательство: Taylor&Francis
Рейтинг:
Цена: 4439.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Design creative characters inspired by real people. Let Mike Mattesi show you how to use life drawing to discover the poses, features and personalities which form the basis of character and then build, develop and `PUSH` your drawings to new heights of dramatic and visual impact for believable characters audiences can relate to.

Автор: Fenstad
Название: General Recursion Theory
ISBN: 1107168163 ISBN-13(EAN): 9781107168169
Издательство: Cambridge Academ
Рейтинг:
Цена: 18216.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Автор: Sacks
Название: Higher Recursion Theory
ISBN: 1107168430 ISBN-13(EAN): 9781107168435
Издательство: Cambridge Academ
Рейтинг:
Цена: 21542.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Автор: Mike Mattesi
Название: Force: Animal Drawing
ISBN: 0240814355 ISBN-13(EAN): 9780240814353
Издательство: Taylor&Francis
Рейтинг:
Цена: 4439.00 р.
Наличие на складе: Поставка под заказ.

Описание: Reach new heights of dramatic and visual impact by applying locomotive animal anatomy with Force: Animal Drawing; the comprehensive guide to developing artistic animals that are creative, dynamic and anatomical. 

Автор: Chong Chitat Et Al
Название: E-Recursion, Forcing And C*-Algebras
ISBN: 9814603252 ISBN-13(EAN): 9789814603256
Издательство: World Scientific Publishing
Цена: 3643.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

This volume presents the lecture notes of short courses given by three leading experts in mathematical logic at the 2012 Asian Initiative for Infinity Logic Summer School. The major topics cover set-theoretic forcing, higher recursion theory, and applications of set theory to C*-algebra. This volume offers a wide spectrum of ideas and techniques introduced in contemporary research in the field of mathematical logic to students, researchers and mathematicians.

Автор: Hinman
Название: Recursion-Theoretic Hierarchies
ISBN: 1107168244 ISBN-13(EAN): 9781107168244
Издательство: Cambridge Academ
Рейтинг:
Цена: 23918.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Автор: Kechris
Название: Ordinal Definability and Recursion Theory
ISBN: 1107033403 ISBN-13(EAN): 9781107033405
Издательство: Cambridge Academ
Рейтинг:
Цена: 26136.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Автор: Rohl
Название: Recursion via Pascal
ISBN: 0521269342 ISBN-13(EAN): 9780521269346
Издательство: Cambridge Academ
Рейтинг:
Цена: 6653.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, the programming language used here is Pascal and the examples have been chosen accordingly. It makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion. The book contains well over 100 examples.

Автор: Shoenfield
Название: Recursion Theory
ISBN: 1107168082 ISBN-13(EAN): 9781107168084
Издательство: Cambridge Academ
Рейтинг:
Цена: 17424.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.