By argumenting first-order logic with monadic partition quantifiers we get a new family of extended logics. They are strictly weaker in expressive power than monadic second-order logic, have some good semantic features and offer better specification formalisms for studying finite automata and formal languages. [References: 37]
展开▼
