2016
DOI: 10.48550/arxiv.1610.03406
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Complexity of syntactical tree fragments of Independence-Friendly logic

Abstract: In 1986 ([2]), Blass and Gurevich proved that any non-linear Henkin quantifier can be applied to a quantifier-free first-order formula in such a way that the resulting sentence characterizes an NP-complete problem. In 2014 Sevenster ([31]) proved a more general result for regular quantifier prefixes of Independence-Friendly (IF ) logic; he showed that these prefixes can express (in the sense described above) either 1) only FO problems or 2) also NP-complete problems. The latter class is constituted by 2a) pref… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 21 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?