Papers from a June 1999 conference present a snapshot of the status of computability theory and suggest directions for future research. Focus is on open problems in computability theory and on some related areas in which the ideas, methods, and results of computability theory play a role. Topics from the area of "pure" computability theory include the computably enumerable degrees and sets, definability issues in the c.e. and Turing degrees, and other degree structures. Subjects involving relations between computability and other areas of logic and mathematics include reverse mathematics and proof theory, set theory, and computable mathematics and model theory. Cholak teaches mathematics at the University of Notre Dame. Lacks a subject index. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: -OnTimeBooks-, Phoenix, AZ, USA
Zustand: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail. Bestandsnummer des Verkäufers OTV.0821819224.G
Anzahl: 1 verfügbar