Computational Semantics for Monadic Quantifiers

Journal of Applied Non--Classical Logics 8 (1-2):107--121 (1998)
  Copy   BIBTEX

Abstract

The paper gives a survey of known results related to computational devices (finite and push–down automata) recognizing monadic generalized quantifiers in finite 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

Categories

Keywords

Reprint years

DOI

10.1080/11663081.1998.10510934

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,931

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Understanding Quantifiers in Language.Jakub Szymanik & Marcin Zajenkowski - 2009 - In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
A generalized quantifier concept in computational complexity theory.Heribert Vollmer - 1999 - In Generalized Quantifiers and Computation (Aix-En-Provence, 1997). Springer. pp. 99--123.
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
Henkin Quantifiers.M. Krynicki & M. Mostowski - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 193--263.
Quantifiers Definable by Second Order Means.M. Mostowski - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 181--214.
Quantifiers, some Problems and Ideas.M. Krynicki & M. Mostowski - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 1--21.
Computable quantifiers and logics over finite structures.J. Makowsky & Y. Pnueli - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 313--357.
Hierarchies of monadic generalized quantifiers.Kerkko Luosto - 2000 - Journal of Symbolic Logic 65 (3):1241-1263.
The relational semantics for branched quantifiers.M. Mostowski - 1987 - In D. Skordev (ed.), Mathematical Logic and its Application. Plenum Press. pp. 315--322.
On second-order generalized quantifiers and finite structures.Anders Andersson - 2002 - Annals of Pure and Applied Logic 115 (1--3):1--32.
Ambigous quantifiers.M. Krynicki & M. Mostowski - 1999 - In E. Orłowska (ed.), Logic at Work. Heidelberg. pp. 548--565.
Ramsey theory is needed for solving definability problems of generalized quantifiers.K. Luosto - 1999 - In Jouko A. Vaananen (ed.), European Summer School in Logic, Language and Information: ESSLLI 1997: Generalized Quantifiers and Computation. Springer. pp. 121--134.
Some Results on Quantifiers.Dag Westerståhl - 1984 - Notre Dame Journal of Formal Logic 25 (2):152--169.

Analytics

Added to PP
2010-11-21

Downloads
70 (#238,916)

6 months
12 (#242,841)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Marcin Mostowski
Last affiliation: Jagiellonian University

Citations of this work

Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.

View all 11 citations / Add more citations

References found in this work

Towards a computational semantics.Johan van Benthem - 1987 - In Peter Gärdenfors (ed.), Generalized Quantifiers. Reidel Publishing Company. pp. 31--71.
Divisibility quantifiers.Marcin Mostowski - 1991 - Bulletin of the Section of Logic 20 (2):67-70.

View all 7 references / Add more references