Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The axiomatic theory of sets is a vibrant part of pure mathematics, with its own basic notions, fundamental results, and deep open problems. At the same time, it is often viewed as a foundation of mathematics so that in the most prevalent, current mathematical practice "to make a notion precise" simply means "to define it in set theory." This book tries to do justice to both aspects of the subject: it gives a solid introduction to "pure set theory" through transfinite recursion and the construction of the cumulative hierarchy of sets, but it also attempts to explain precisely how mathematical objects can be faithfully modeled within the universe of sets. In this new edition the author added solutions to selected exercises, and rearranged and reworked the text in several places to improve the presentation. The book is aimed at advanced undergraduate or beginning graduate mathematics students and at mathematically minded graduate students of computer science and philosophy.

Set theory --- Aggregates --- Classes (Mathematics) --- Ensembles (Mathematics) --- Mathematical sets --- Sets (Mathematics) --- Theory of sets --- Logic, Symbolic and mathematical --- Mathematics --- Logic, Symbolic and mathematical. --- Computer science. --- Mathematical Logic and Foundations. --- Mathematical Logic and Formal Languages. --- Informatics --- Science --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Syllogism --- Mathematical logic.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Recursion theory. --- Induction (Mathematics)