The Computational Complexity of Some Logical Theories
| dc.contributor.advisor | Meyer, Albert R. | en_US |
| dc.contributor.author | Rackoff, Charles Weill | en_US |
| dc.date.accessioned | 2023-03-29T14:59:05Z | |
| dc.date.available | 2023-03-29T14:59:05Z | |
| dc.date.issued | 1975-02 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149441 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-144 | |
| dc.relation.ispartofseries | MAC-TR-144 | |
| dc.title | The Computational Complexity of Some Logical Theories | en_US |
| dc.identifier.oclc | 02026542 |
