Hilbert's ε-Symbol in the Presence of Generalized Quantifiers

In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 63--78 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

Hilbert∈-symbol in the presence of generalized quantifiers.Xavier Caicedo - 1991 - Bulletin of the Section of Logic 20 (3/4):85-86.
Definability of Second Order Generalized Quantifiers.Juha Kontinen - 2004 - Dissertation,
Directions in Generalized Quantifier Theory.Dag Westerståhl & J. F. A. K. van Benthem - 1995 - Studia Logica 55 (3):389-419.
The Hierarchy Theorem for Second Order Generalized Quantifiers.Juha Kontinen - 2006 - Journal of Symbolic Logic 71 (1):188 - 202.
Natural language, sortal reducibility and generalized quantifiers.Edward L. Keenan - 1993 - Journal of Symbolic Logic 58 (1):314-325.
Dynamic Generalized Quantifiers.Martin van den Berg - 1996 - In J. van der Does & Van J. Eijck (eds.), Quantifiers, Logic, and Language. Stanford University. pp. 63--94.
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.
Generalized Quantifiers, and Beyond.Hanoch Ben-Yami - 2009 - Logique Et Analyse (208):309-326.
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.
Quantification.Anna Szabolcsi - 2010 - New York: Cambridge University Press.
Aristotelian syllogisms and generalized quantifiers.Dag Westerståhl - 1989 - Studia Logica 48 (4):577-585.
Almost All Complex Quantifiers are Simple.Jakub Szymanik - 2010 - In C. Ebert, G. Jäger, M. Kracht & J. Michaelis (eds.), Mathematics of Language 10/11, Lecture Notes in Computer Science 6149. Springer.
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.

Analytics

Added to PP
2014-01-31

Downloads
19 (#775,535)

6 months
2 (#1,263,261)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references