Computational Semantics for Monadic Quantifiers
Marcin Mostowski · Journal of Applied Non-Classical Logics · 1998
This paper gives a survey of known results related to computational devices (finite and push-down automata) recognising monadic generalised quantifiers infinite models. Some of these results are simple reinterpretations of descriptive-feasible correspondence theorems from finite-model theory. Additionally a new result characterizing monadic quantifiers recognized by push down automata is proven.