Monadic second-order logic: Difference between revisions

Revision as of 03:53, 17 September 2016

Revision as of 18:32, 17 September 2016

Line 1:

In [[mathematical logic]], '''monadic second order logic (MSO)''' is the fragment of [[Higher-order logic|second-order logic]] where the second-order quantification is limited to quantification over sets.<ref>{{cite book|first1=Bruno|last1=Courcelle|first2=Joost|last2=Engelfriet| title=Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach| publisher=Cambridge University Press|date=2012-01-01|isbn=978-0521898331|url=http://dl.acm.org/citation.cfm?id=2414243|accessdate=2016-09-15}}</ref> (MSO) is the fragment of [[Higher-order logic|second-order logic]] where the second-order quantification is limited to quantification over sets. It is particularly important in the [[logic of graphs]], because of [[Courcelle's theorem]], which provides algorithms for evaluating monadic second-order formulas over certain types of graphs.

==References==