- 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
On generalized Van Benthem-type characterizations
Annals of Pure and Applied Logic 168 (9):1643-1691 (2017)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Generalized Quantifiers in Natural Language.Johan Van Benthem & Alice Ter Meulen (eds.) - 1984 - Foris Publications.
The hierarchy theorem for generalized quantifiers.Lauri Hella, Kerkko Luosto & Jouko Väänänen - 1996 - Journal of Symbolic Logic 61 (3):802-817.
Towards a computational semantics.Johan van Benthem - 1987 - In Peter Gärdenfors, Generalized Quantifiers. Reidel Publishing Company. pp. 31--71.
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.
Directions in Generalized Quantifier Theory.Dag Westerståhl & Johan van Benthem - 1995 - Studia Logica 55 (3):389-419.
Some remarks on the model theory of epistemic plausibility models.Lorenz Demey - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):375-395.
Solovay-Type Characterizations for Forcing-Algebras.Jörg Brendle & Benedikt Löwe - 1999 - Journal of Symbolic Logic 64 (3):1307-1323.
Analytics
Added to PP
2017-03-11
Downloads
58 (#1,036,626)
6 months
8 (#1,334,740)
2017-03-11
Downloads
58 (#1,036,626)
6 months
8 (#1,334,740)
Historical graph of downloads
Citations of this work
Craig Interpolation Theorem Fails in Bi-Intuitionistic Predicate Logic.Grigory K. Olkhovikov & Guillermo Badia - 2024 - Review of Symbolic Logic 17 (2):611-633.
A Lindström theorem for intuitionistic first-order logic.Grigory Olkhovikov, Guillermo Badia & Reihane Zoghifard - 2023 - Annals of Pure and Applied Logic 174 (10):103346.
A Lindström Theorem for Intuitionistic Propositional Logic.Guillermo Badia - 2020 - Notre Dame Journal of Formal Logic 61 (1):11-30.
References found in this work
Model-theoretic characterization of intuitionistic propositional formulas.Grigory K. Olkhovikov - 2013 - Review of Symbolic Logic 6 (2):348-365.
On expressive power of basic modal intuitionistic logic as a fragment of classical FOL.Grigory K. Olkhovikov - 2017 - Journal of Applied Logic 21 (C):57-90.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
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