|Title:|| ORACLES AND QUANTIFIERS.
|Authors:|| J.A. Makowsky and Y.B. Pnueli
We describe a general way of building logics with Lindstrom quantifiers which capture complexity classes based on oracle Turing machines. Our approach is sensitive to the oracle computation model. Our results hold for the unbounded model introduced by Buss in support of his `relativization thesis'. They do not hold for the nondeterministic and alternating oracle computations studied by Ladner and Lynch, Simon and Ruzzo, Simon and Tompa. Our results generalize and extend previous results of Stewart and Makowsky and Pnueli.
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1993/CS/CS0785), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1993
To the main CS technical reports page
Computer science department, Technion