Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the Ranked Points of A pi01 Set., and . J. Symb. Log., 54 (3): 975-991 (1989)Computability of Countable Subshifts., , , and . CiE, volume 6158 of Lecture Notes in Computer Science, page 88-97. Springer, (2010)Complexity, decidability and completeness., and . J. Symb. Log., 71 (2): 399-424 (2006)Pseudojump Operators and P01 Classes., , and . CiE, volume 4497 of Lecture Notes in Computer Science, page 146-151. Springer, (2007)Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels., , and . AI&M, (2000)The Complexity of Inductive Definability., and . CiE, volume 3526 of Lecture Notes in Computer Science, page 75-85. Springer, (2005)Members of countable π10 classes., , , , and . Ann. Pure Appl. Log., (1986)Locally Determined Logic Programs., , and . LPNMR, volume 1730 of Lecture Notes in Computer Science, page 34-48. Springer, (1999)A Good Oracle Is Hard to Beat., and . Algorithmica, 22 (1/2): 18-34 (1998)Feasibly Categorial Models., and . LCC, volume 960 of Lecture Notes in Computer Science, page 300-312. Springer, (1994)