| TR#: | CS0768 |
| Class: | CS |
| Title: | COMPUTABLE QUANTIFIERS AND
LOGICS OVER FINITE STRUCTURES. |
| Authors: | J. A. Makowsky and Y.B. Pnueli |
| CS0768.pdf | |
| Abstract: |
We introduce the notion of computable quantifiers over finite structures and use them to give a unified treatment of the theory of computable queries in databases and logics capturing complexity classes. We use this framework also to discuss generalized Ehrenfeucht-Fra\"{\i}ss\'{e} games and their applications to complexity theory.
|
| 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/CS0768), 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