Monadic second-order logic
In mathematical logic, monadic second-order logic (MSO) is the fragment of 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 graphs of bounded treewidth.
Wikipage redirect
Clique-widthComputation tree logicCourcelle's theoremDeterministic finite automatonEMSOEnumeration algorithmLogic of graphsMSOMSOLMSO logicModel checkingMonadic second-orderMonadic second order logicMonochromatic triangleMuller–Schupp theoremNonelementary problemPlural quantificationReactive synthesisS2SSecond-order logicTreewidth
Link from a Wikipage to another Wikipage
primaryTopic
Monadic second-order logic
In mathematical logic, monadic second-order logic (MSO) is the fragment of 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 graphs of bounded treewidth.
has abstract
In mathematical logic, monadic ...... which the predicate is true).
@en
Wikipage page ID
14,650,395
page length (characters) of wiki page
Wikipage revision ID
997,976,220
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In mathematical logic, monadic ...... r graphs of bounded treewidth.
@en
label
Monadic second-order logic
@en