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)
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Da: Moe's Books, Berkeley, CA, U.S.A.
Soft cover. Condizione: Very good. No jacket. Excellent, clean condition. One corner lightly creased, else near fine. Codice articolo 1127933
Quantità: 1 disponibili