Listing 1 - 10 of 131 | << page >> |
Sort by
|
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
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. The theory set out in this volume, the ninth publication in the Perspectives in Logic series, is the result of the meeting and common development of two currents of mathematical research: descriptive set theory and recursion theory. Both are concerned with notions of definability and with the classification of mathematical objects according to their complexity. These are the common themes which run through the topics discussed here. The author develops a general theory from which the results of both areas can be derived, making these common threads clear.
Choose an application
This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems.
Choose an application
Choose an application
Annotation. This book represents the first treatment of computable analysis at the graduate level within the tradition of classical mathematical reasoning. Among the topics dealt with are: classical analysis, Hilbert and Banach spaces, bounded and unbounded linear operators, eigenvalues, eigenvectors, and equations of mathematical physics. The book is self-contained, and yet sufficiently detailed to provide an introduction to research in this area.
Listing 1 - 10 of 131 | << page >> |
Sort by
|