Abstract
We expose a strict hierarchy within monotone monadic strict NP without inequalities (MMSNP), based on the number of second-order monadic quantifiers. We do this by studying a finer strict hierarchy within a class of forbidden patterns problems (FPP), based on the number of permitted colours. Through an adaptation of a preservation theorem of Feder and Vardi, we are able to prove that this strict hierarchy also exists in monadic strict NP (MSNP). Our hierarchy results apply over a uniform signature involving a single binary relation, that is over digraphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Otto, M.: A note on the number of monadic quantifiers in monadic \(\Sigma^1_1\). Information Processing Letters 53(6), 337–339 (1995)
Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundladen der Mathematik 6, 66–92 (1960)
Elgot, C.: Decision problems of finite-automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21–51 (1961)
Thomas, W.: Classifying regular events in symbolic logic. Journal of Computer and System Sciences 25, 360–376 (1982)
Madelaine, F.: Constraint satisfaction problems and related logic. PhD thesis, University of Leicester (2003)
Madelaine, F., Stewart, I.A.: Constraint satisfaction, logic and forbidden patterns (SIAM Journal of Computing) 33 pages (to appear)
Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM J. Comput. 28 (1999)
Kun, G.: Constraints, MMSNP and expander structures (2006)
Erdös, P.: Graph theory and probability. Canad. J. Math. 11, 34–38 (1959)
Hell, P., Nešetřil, J.: Graphs and Homomorphisms. OUP (2004)
Feder, T., Vardi, M.: Homomorphism closed vs existential positive (2003)
Fagin, R.: Monadic generalized spectra. Z. Math. Logik Grund. Math 21, 89–96 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, B., Madelaine, F. (2007). Hierarchies in Fragments of Monadic Strict NP . In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-73001-9_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73000-2
Online ISBN: 978-3-540-73001-9
eBook Packages: Computer ScienceComputer Science (R0)