Journal of Logic, Language and Information 17 (3):323-344 (2008)
Motivated by constraint satisfaction problems, Feder and Vardi (SIAM Journal of Computing, 28, 57–104, 1998) set out to search for fragments of satisfying the dichotomy property: every problem definable in is either in P or else NP-complete. Feder and Vardi considered in this connection two logics, strict NP (or SNP) and monadic, monotone, strict NP without inequalities (or MMSNP). The former consists of formulas of the form , where is a quantifier-free formula in a relational vocabulary; and the latter is the fragment of SNP whose formulas involve only negative occurrences of relation symbols, only monadic second-order quantifiers, and no occurrences of the equality symbol. It remains an open problem whether MMSNP enjoys the dichotomy property. In the present paper, SNP and MMSNP are characterized in terms of partially ordered connectives. More specifically, SNP is characterized using the logic D of partially ordered connectives introduced in Blass and Gurevich (Annals of Pure and Applied Logic, 32, 1–16, 1986), Sandu and Väänänen (Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 38, 361–372 1992), and MMSNP employing a generalization C of D introduced in the present paper.
|Keywords||Constraint satisfaction problems Generalized quantifiers Henkin quantifiers MMSNP Partially ordered connectives SNP|
|Categories||categorize this paper)|
References found in this work BETA
On Branching Quantifiers in English.Jon Barwise - 1979 - Journal of Philosophical Logic 8 (1):47 - 80.
Finite Partially-Ordered Quantification.Wilbur John Walkoe Jr - 1970 - Journal of Symbolic Logic 35 (4):535-555.
Henkin Quantifiers and Complete Problems.A. Blass & Y. Gurevich - 1986 - Annals of Pure and Applied Logic 32 (1):1--16.
Finite Partially‐Ordered Quantifiers.Herbert B. Enderton - 1970 - Mathematical Logic Quarterly 16 (8):393-397.
Citations of this work BETA
No citations found.
Similar books and articles
Strict Embedding of the Elementary Ontology Into the Monadic Second-Order Calculus of Predicates Admitting the Empty Individual Domain.Vladimir A. Smirnov - 1987 - Studia Logica 46 (1):1 - 15.
Hierarchies of Monadic Generalized Quantifiers.Kerkko Luosto - 2000 - Journal of Symbolic Logic 65 (3):1241-1263.
Partially Ordered Quantifiers Vs. Partially Ordered Ideas.Jaakko Hintikka - 1976 - Dialectica 30 (1):89--99.
Propositional Quantification in the Monadic Fragment of Intuitionistic Logic.Tomasz Połacik - 1998 - Journal of Symbolic Logic 63 (1):269-300.
An Application of Rieger-Nishimura Formulas to the Intuitionistic Modal Logics.Dimiter Vakarelov - 1985 - Studia Logica 44 (1):79 - 85.
Partially Ordered Sets and the Independence Property.James H. Schmerl - 1989 - Journal of Symbolic Logic 54 (2):396-401.
Decidability and ℵ0-Categoricity of Theories of Partially Ordered Sets.James H. Schmerl - 1980 - Journal of Symbolic Logic 45 (3):585 - 611.
Decidability and Finite Axiomatizability of Theories of ℵ0-Categorical Partially Ordered Sets.James H. Schmerl - 1981 - Journal of Symbolic Logic 46 (1):101 - 120.
Added to index2009-01-28
Total downloads19 ( #261,540 of 2,177,988 )
Recent downloads (6 months)1 ( #317,698 of 2,177,988 )
How can I increase my downloads?