The Computational Complexity of Some Logical Theories
Name
MIT-LCS-TR-144.pdf
Size
4.05 MB
Format
Adobe PDF
Checksum (MD5)
5ee4a18eda0a55ebcadcafd8dbaa5219
Author(s)
Rackoff, Charles Weill
Advisor(s)
Meyer, Albert R.
Date Issued
February 1975
Series/Report no.
MIT-LCS-TR-144
MAC-TR-144
Abstract
Upper and lower bounds on the inherent computational complexity of the decision problem for a number of logical theories are established. A general form of Ehrenfeucht game technique for deciding theories is developed which involves analyzing the expressive power of formulas with given quantifier depth. The method allows one to decide the truth of sentences by limiting quantifiers to range over finite sets.
Persistent DSpace Link
