Hierarchies of monadic generalized quantifiers

Journal of Symbolic Logic 65 (3):1241-1263 (2000)
  Copy   BIBTEX

Abstract

A combinatorial criterium is given when a monadic quantifier is expressible by means of universe-independent monadic quantifiers of width n. It is proved that the corresponding hierarchy does not collapse. As an application, it is shown that the second resumption (or vectorization) of the Hartig quantifier is not definable by monadic quantifiers. The techniques rely on Ramsey theory

Categories

Keywords

Reprint years

DOI

10.2307/2586699

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

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

Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz, Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
On second-order generalized quantifiers and finite structures.Anders Andersson - 2002 - Annals of Pure and Applied Logic 115 (1--3):1--32.
Quantifiers.Dag Westerståhl - 2001 - In Lou Goble, The Blackwell Guide to Philosophical Logic. Malden, Mass.: Wiley-Blackwell. pp. 437–460.
Expressing cardinality quantifiers in monadic second-order logic over chains.Vince Bárány, Łukasz Kaiser & Alexander Rabinovich - 2011 - Journal of Symbolic Logic 76 (2):603 - 619.
Quantifiers and congruence closure.Jörg Flum, Matthias Schiehlen & Jouko Väänänen - 1999 - Studia Logica 62 (3):315-340.
Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
Definability in the monadic second-order theory of successor.J. Richard Buchi & Lawrence H. Landweber - 1969 - Journal of Symbolic Logic 34 (2):166 - 170.
An Alternative Definition of Quantifiers on Four-Valued Łukasiewicz Algebras.L. J. González, M. B. Lattanzi & A. G. Petrovich - 2017 - Logica Universalis 11 (4):439-463.
First order quantifiers in monadic second order logic.H. Jerome Keisler & Wafik Boulos Lotfallah - 2004 - Journal of Symbolic Logic 69 (1):118-136.
The hierarchy theorem for generalized quantifiers.Lauri Hella, Kerkko Luosto & Jouko Väänänen - 1996 - Journal of Symbolic Logic 61 (3):802-817.

Analytics

Added to PP
2009-01-28

Downloads
151 (#154,724)

6 months
13 (#197,488)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Definability of polyadic lifts of generalized quantifiers.Lauri Hella, Jouko Väänänen & Dag Westerståhl - 1997 - Journal of Logic, Language and Information 6 (3):305-335.
Unary quantifiers on finite models.Jouko Väänänen - 1997 - Journal of Logic, Language and Information 6 (3):275-304.
On vectorizations of unary generalized quantifiers.Kerkko Luosto - 2012 - Archive for Mathematical Logic 51 (3):241-255.

Add more citations

References found in this work

Definability hierarchies of general quantifiers.Lauri Hella - 1989 - Annals of Pure and Applied Logic 43 (3):235.
Finite generation problem and n-ary quantifiers.Lauri Hella & Kerkko Luosto - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba, Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 63--104.

Add more references