Cantitate/Preț
Produs
Total produse
Vezi coșul
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers de P. Odifreddi

Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers: Studies in Logic and the Foundations of Mathematics, cartea 125

Autor P. Odifreddi
en Limba Engleză Paperback – 3 feb 1992
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.
Citește tot Restrânge

Din seria Studies in Logic and the Foundations of Mathematics

Preț: 54717 lei

Preț vechi: 71060 lei
-23% Nou

Puncte Express: 821
Preț estimativ în valută:
10472€ • 11048$ • 8727£

Carte tipărită la comandă

Livrare economică 03-17 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780444894830
ISBN-10: 0444894837
Pagini: 692
Dimensiuni: 156 x 234 x 35 mm
Greutate: 0.95 kg
Ediția:Revised
Editura: ELSEVIER SCIENCE
Seria Studies in Logic and the Foundations of Mathematics

Cuprins

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.

Recenzii

from:G.E. Sacks, Harvard University and M.I.T.
"Odifreddi has written a delightful yet scholarly treatise..."

from:C. Calude
"An impressive presentation of classical recursion theory... highly recommended to everyone interested in recursion theory." --Zentralblatt für Mathematik

"A must as a reference manual for any mathematician, philosopher or theoretical computer scientist who deals with issues of computability." --Mathematical Reviews

"An incredible wealth of information, including much that occurs for the first time in book form." --Journal of Symbolic Logic