- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Computational Semantics for Monadic Quantifiers
Journal of Applied Non-Classical Logics 8 (1-2):107-121 (1998)
Abstract
ABSTRACT This paper gives a survey of known results related to computational devices recognising monadic generalised quantifiers infinite 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.Author's Profile
My notes
Similar books and articles
Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
Computational semantics for monadic quantifiers in natural language.J. Szymanik - 2007 - Studia Semiotyczne 26:219-244.
Hierarchies of monadic generalized quantifiers.Kerkko Luosto - 2000 - Journal of Symbolic Logic 65 (3):1241-1263.
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.
Quantifiers and Working Memory.Jakub Szymanik & Marcin Zajenkowski - 2010 - In Maria Aloni & Katrin Schulz (eds.), Amsterdam Colloquium 2009, LNAI 6042. Springer.
Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
Directions in Generalized Quantifier Theory.Dag Westerståhl & J. F. A. K. van Benthem - 1995 - Studia Logica 55 (3):389-419.
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.
A Computational Approach to Quantifiers as an Explanation for Some Language Impairments in Schizophrenia.Marcin Zajenkowski, Rafał Styła & Jakub Szymanik - 2011 - Journal of Communication Disorder 44:2011.
Varieties of monadic Heyting algebras part II: Duality theory.Guram Bezhanishvili - 1999 - Studia Logica 62 (1):21-48.
Improving Methodology of Quantifier Comprehension Experiments.Jakub Szymanik & Marcin Zajenkowski - 2009 - Neuropsychologia 47 (12):2682--2683.
Degrees of logics with Henkin quantifiers in poor vocabularies.Marcin Mostowski & Konrad Zdanowski - 2004 - Archive for Mathematical Logic 43 (5):691-702.
Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
Towards a computational semantics.Johan van Benthem - 1987 - In Peter Gärdenfors (ed.), Generalized Quantifiers. Reidel Publishing Company. pp. 31--71.
Construction of monadic three-valued łukasiewicz algebras.Luiz Monteiro, Sonia Savini & Julio Sewald - 1991 - Studia Logica 50 (3-4):473 - 483.
Analytics
Added to PP
2016-02-04
Downloads
23 (#661,981)
6 months
5 (#652,053)
2016-02-04
Downloads
23 (#661,981)
6 months
5 (#652,053)
Historical graph of downloads
Author's Profile
Citations of this work
Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model.Jakub Szymanik & Marcin Zajenkowski - 2010 - Cognitive Science 34 (3):521-532.
The Computational Origin of Representation.Steven T. Piantadosi - 2020 - Minds and Machines 31 (1):1-58.
Assertion, denial, and the evolution of Boolean operators.Fausto Carcassi & Giorgio Sbardolini - 2023 - Mind and Language 38 (5):1187-1207.
Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
Quantifiers satisfying semantic universals have shorter minimal description length.Iris van de Pol, Paul Lodder, Leendert van Maanen, Shane Steinert-Threlkeld & Jakub Szymanik - 2023 - Cognition 232 (C):105150.
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.
Quantifiers: Logics, Models and Computation: Volume Two: Contributions.Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.) - 1995 - Dordrecht, Netherland: Kluwer Academic Publishers.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-l2pxr uwo