Computational Semantics for Monadic Quantifiers
作者:
Marcin Mostowski,
期刊:
Journal of Applied Non-Classical Logics
(Taylor Available online 1998)
卷期:
Volume 8,
issue 1-2
页码: 107-121
ISSN:1166-3081
年代: 1998
DOI:10.1080/11663081.1998.10510934
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
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.
点击下载:
PDF (712KB)
返 回