Decidability and Generalized Quantifiers

Journal of Symbolic Logic 47 (4):907-908 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273113

Links

PhilArchive



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

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

Review: Andreas Baudisch, Detlef Seese, Hans-Peter Tuschik, Martin Weese, Decidability and Generalized Quantifiers. [REVIEW]John Cowles - 1982 - Journal of Symbolic Logic 47 (4):907-908.
Decidability and generalized quantifiers.Andreas Baudisch (ed.) - 1980 - Berlin: Akademie Verlag.
Definability of Second Order Generalized Quantifiers.Juha Kontinen - 2004 - Dissertation,
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.
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.
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.
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.
On second-order generalized quantifiers and finite structures.Anders Andersson - 2002 - Annals of Pure and Applied Logic 115 (1--3):1--32.
Quantification.Anna Szabolcsi - 2010 - New York: Cambridge University Press.
Aristotelian syllogisms and generalized quantifiers.Dag Westerståhl - 1989 - Studia Logica 48 (4):577-585.
Decidability problems in languages with Henkin quantifiers.Michał Krynicki & Marcin Mostowski - 1992 - Annals of Pure and Applied Logic 58 (2):149-172.
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.

Analytics

Added to PP
2017-02-21

Downloads
3 (#1,613,047)

6 months
1 (#1,346,405)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references