𝔖 Bobbio Scriptorium
✦   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

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

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

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