Authors
Marcin Mostowski
Jagiellonian University
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
Keywords bibtex-import   generalized   quantifiers
Categories (categorize this paper)
ISBN(s)
DOI 10.1080/11663081.1998.10510934
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 58,943
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Divisibility Quantifiers.Marcin Mostowski - 1991 - Bulletin of the Section of Logic 20 (2):67-70.

View all 7 references / Add more references

Citations of this work BETA

Iterating Semantic Automata.Shane Steinert-Threlkeld & I. I. I. Thomas F. Icard - 2013 - Linguistics and Philosophy 36 (2):151-173.
Some Properties of Iterated Languages.Shane Steinert-Threlkeld - 2016 - Journal of Logic, Language and Information 25 (2):191-213.

View all 7 citations / Add more citations

Similar books and articles

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.
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.
Some Results on Quantifiers.Dag Westerståhl - 1984 - Notre Dame Journal of Formal Logic 25 (2):152--169.

Analytics

Added to PP index
2010-11-21

Total views
56 ( #182,349 of 2,426,897 )

Recent downloads (6 months)
1 ( #541,589 of 2,426,897 )

How can I increase my downloads?

Downloads

My notes