Technical Report CS0818

TR#:CS0818
Class:CS
Title: ARITY VS. ALTERNATION IN SECOND ORDER LOGIC.
Authors: J.A. Makowsky and Y.B. Pnueli
PDFCS0818.pdf
Abstract:

We investigate the expressive power of second order logic over finite structures, when two limitations are imposed. Let SAA(K,N)\ (AA(K,N)) be the set of second order formulas such that the arity of the relation variables is bounded by k and the number of alternations of (both first order and) second order quantification is bounded by n. We show that this imposes a proper hierarchy on second order logic, i.e., for every k,n there are problems not definable in AA(k,n) but definable in AA(k+c_1, n+d_1) for some c_1,d_1. The method to show this is to introduce the set AUTOSAT(F) of formulas in F which satisfy themselves. We study the complexity of this set for various fragments of second order logic. For first order logic FOL with unbounded alternation of quantifiers AUTOSAT(FOL) is P Space-complete. For first order logic FOL_n with alternation of quantifiers bounded by n, AUTOSAT(FOL_N) is definable in AA(3,n+4). AUTOSAT(AA(K,N)) is definable in AA(k+c_1,n+d_1) for some c_1,d_1.

CopyrightThe 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/1994/CS/CS0818), 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 1994
To the main CS technical reports page

Computer science department, Technion
admin