It is well known that on classes of graphs of bounded tree-width, every monadic second-order property is decidable in polynomial time. The converse is not true without further assumptions. It follows from the work of Robertson and Seymour, that if a class of graphs K has unbounded tree-width and is
β¦ LIBER β¦
Hierarchies of Monadic Generalized Quantifiers
β Scribed by Kerkko Luosto
- Book ID
- 124978573
- Publisher
- Association for Symbolic Logic
- Year
- 2000
- Tongue
- English
- Weight
- 521 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0022-4812
- DOI
- 10.2307/2586699
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Tree-width and the monadic quantifier hi
β
J.A. Makowsky; J.P. MariΓ±o
π
Article
π
2003
π
Elsevier Science
π
English
β 269 KB
The Monadic Quantifier Alternation Hiera
β
Oliver Matz; Nicole Schweikardt; Wolfgang Thomas
π
Article
π
2002
π
Elsevier Science
π
English
β 267 KB
A note on the number of monadic quantifi
β
Martin Otto
π
Article
π
1995
π
Elsevier Science
π
English
β 275 KB
Vectorization hierarchies of some graph
β
Lauri Hella; Juha Nurmonen
π
Article
π
2000
π
Springer
π
English
β 198 KB
Hierarchies of Partially Ordered Connect
β
MichaΕ Krynicki
π
Article
π
1993
π
John Wiley and Sons
π
English
β 381 KB
## Abstract Connections between partially ordered connectives and Henkin quantifiers are considered. It is proved that the logic with all partially ordered connectives and the logic with all Henkin quantifiers coincide. This implies that the hierarchy of partially ordered connectives is strongly hi
Hierarchies of weak automata and weak mo
β
A.W. Mostowski
π
Article
π
1991
π
Elsevier Science
π
English
β 773 KB