Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Classical Recursion Theory - P. Odifreddi

Classical Recursion Theory

The Theory of Functions and Sets of Natural Numbers

(Autor)

Buch | Softcover
692 Seiten
1992
North-Holland (Verlag)
978-0-444-89483-0 (ISBN)
CHF 118,70 inkl. MwSt
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
Includes a number of applications to logic (in particular Godel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation. This book presents a comprehensive reference for the subject starting from first principles.
1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles.Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Gödel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.

Recursiveness and Computability. Induction. Systems of Equations. Arithmetical Formal Systems. Turing Machines. Flowcharts. Functions as Rules. Arithmetization. Church's Thesis. Basic Recursion Theory. Partial Recursive Functions. Diagonalization. Partial Recursive Functionals. Effective Operations. Indices and Enumerations. Retraceable and Regressive Sets. Post's Problem and Strong Reducibilities. Post's Problem. Simple Sets and Many-One Degrees. Hypersimple Sets and Truth-Table Degrees. Hyperhypersimple Sets and Q-Degrees. A Solution to Post's Problem. Creative Sets and Completeness. Recursive Isomorphism Types. Variations of Truth-Table Reducibility. The World of Complete Sets. Formal Systems and R.E. Sets. Hierarchies and Weak Reducibilities. The Arithmetical Hierarchy. The Analytical Hierarchy. The Set-Theoretical Hierarchy. The Constructible Hierarchy. Turing Degrees. The Language of Degree Theory. The Finite Extension Method. Baire Category. The Coinfinite Extension Method. The Tree Method. Initial Segments. Global Properties. Degree Theory with Jump. Many-One and Other Degrees. Distributivity. Countable Initial Segments. Uncountable Initial Segments. Global Properties. Comparison of Degree Theories. Structure Inside Degrees. Bibliography. Index.

Erscheint lt. Verlag 4.2.1992
Reihe/Serie Studies in Logic and the Foundations of Mathematics
Sprache englisch
Gewicht 1050 g
Themenwelt Mathematik / Informatik Mathematik Logik / Mengenlehre
ISBN-10 0-444-89483-7 / 0444894837
ISBN-13 978-0-444-89483-0 / 9780444894830
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
how simple questions lead us to mathematics’ deepest truths

von Eugenia Cheng

Buch | Softcover (2024)
Profile Books Ltd (Verlag)
CHF 19,15