A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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 forlnal languages.doi:10.1016/0304-3975(95)00113-1 fatcat:jf5c7duqb5bt3g4nvtj3dfpjnm