On the public citation graph
Directions in generalized quantifier theory
0 signed · 86 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/10849.1572-9583openalex-snapshot
Journal of Logic, Language and Information
inferredcites →https://doi.org/10.1007/3-540-51498-8_23openalex-snapshot
Descriptive and computational complexity
inferredcites →https://doi.org/10.1007/978-1-4020-6324-4_4openalex-snapshot
Quantifiers in Formal and Natural Languages
inferredcites →https://doi.org/10.1007/978-94-009-3381-1_5openalex-snapshot
Unreducible N-Ary Quantifiers in Natural Language
inferredcites →https://doi.org/10.1007/978-94-009-4540-1openalex-snapshot
Essays in Logical Semantics
inferredcites →https://doi.org/10.1007/978-94-017-0522-6_10openalex-snapshot
Computable Quantifiers and Logics over Finite Structures
inferredcites →https://doi.org/10.1007/978-94-017-0522-6_4openalex-snapshot
Finite Generation Problem and n-ary Quantifiers
inferredcites →https://doi.org/10.1007/978-94-017-0524-0_1openalex-snapshot
Quantifiers and Inference
inferredcites →https://doi.org/10.1007/978-94-017-0524-0_10openalex-snapshot
Quantifiers Definable by Second Order Means
inferredcites →https://doi.org/10.1007/978-94-017-0524-0_7openalex-snapshot
Quantifiers Determined by Classes of Binary Relations
inferredcites →https://doi.org/10.1007/bf00203385openalex-snapshot
Dynamic interpretation and hoare deduction
inferredcites →https://doi.org/10.1007/bf00370684openalex-snapshot
Algebraization of quantifier logics, an introductory overview
inferredcites →https://doi.org/10.1007/bf00873254openalex-snapshot
Constructive generalized quantifiers
inferredcites →https://doi.org/10.1007/bf00984775openalex-snapshot
Weak vs. strong readings of donkey sentences and monotonicity inference in a dynamic setting
inferredcites →https://doi.org/10.1007/bf00985574openalex-snapshot
E-type pronouns, i-sums, and donkey anaphora
inferredcites →https://doi.org/10.1007/bf01051767openalex-snapshot
Generalized quantifiers and modal logic
inferredcites →https://doi.org/10.1007/bf01305232openalex-snapshot
An optimal lower bound on the number of variables for graph identification
inferredcites →https://doi.org/10.1007/bf01349563openalex-snapshot
Scopeless quantifiers and operators
inferredcites →https://doi.org/10.1007/bf02297653openalex-snapshot
On orderings of the family of all logics
inferredcites →https://doi.org/10.1016/0003-4843(76)90021-8openalex-snapshot
δ-Logics and generalized quantifiers
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0168-0072(89)90070-5openalex-snapshot
Definability hierarchies of generalized quantifiers
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
inferredcites →https://doi.org/10.1016/s0041-2678(69)80115-6openalex-snapshot
University College of Swansea
inferredcites →https://doi.org/10.1016/s0049-237x(09)x7024-2openalex-snapshot
Language in Action - Categories, Lambdas and Dynamic Logic
inferredcites →https://doi.org/10.1016/s0898-1221(96)90117-0openalex-snapshot
Representing time in natural language: The dynamic interpretation of tense and aspect
inferredcites →https://doi.org/10.1090/psapm/038/1020810openalex-snapshot
Descriptive and computational complexity
inferredcites →https://doi.org/10.1093/logcom/5.2.213openalex-snapshot
Generalized Quantifiers and Logical Reducibilities
inferredcites →https://doi.org/10.1109/lics.1992.185547openalex-snapshot
Generalized quantifiers and pebble games on finite structures
inferredcites →https://doi.org/10.1109/lics.1992.185548openalex-snapshot
Logical hierarchies in PTIME
inferredcites →https://doi.org/10.1111/j.1755-2567.1966.tb00600.xopenalex-snapshot
First Order Predicate Logic with Generalized Quantifiers
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.1163/9789004252882_014openalex-snapshot
A Theory of Truth and Semantic Representation
inferredcites →https://doi.org/10.1305/ndjfl/1093870519openalex-snapshot
Vector spaces and binary quantifiers.
inferredcites →https://doi.org/10.1515/9783110867602.1openalex-snapshot
A Theory of Truth and Semantic Representation
inferredcites →https://doi.org/10.1515/9783110867909openalex-snapshot
Generalized Quantifiers in Natural Language
inferredcites →https://doi.org/10.1515/9783110867909.45openalex-snapshot
Determiners and Context Sets
inferredcites →https://doi.org/10.1515/9783112420027-004openalex-snapshot
Quantification as a Major Module of Natural Language Semantics
inferredcites →https://doi.org/10.1515/tlir.1981.1.1.41openalex-snapshot
Questions, quantifiers and crossing
inferredcites →https://doi.org/10.2178/jsl/1183743738openalex-snapshot
Axiomatizing Universal Properties of Quantifiers
inferredcites →https://doi.org/10.2307/2272748openalex-snapshot
The Hanf number of second order logic
inferredcites →https://doi.org/10.2307/2274837openalex-snapshot
Johan van Benthem. A manual of intensional logic. CSLI lecture notes, no. 1. Center for the Study of Language and Information, Stanford 1985, also distributed by the University of Chicago Press, 74 pp. - Johan van Benthem. A manual of intensional logic. Revised and expanded second edition. CSLI…
inferredcites →https://doi.org/10.2307/2274890openalex-snapshot
A Hierarchy Theorem for Lindstrom Quantifiers.
inferredcites →https://doi.org/10.2307/2275339openalex-snapshot
Natural language, sortal reducibility and generalized quantifiers
inferredcites →https://doi.org/10.2307/2275786openalex-snapshot
The hierarchy theorem for generalized quantifiers
inferredcites →https://doi.org/10.2307/415897openalex-snapshot
Representing time in natural language : The dynamic interpretation of tense and aspect. By Alice Ter Meulen. Cambridge, MA: MIT Press, 1995. Pp. 144.
inferredcites →https://doi.org/10.5281/zenodo.8100764openalex-snapshot
The Semantics of Definite and Indefinite Noun Phrases
inferredcites →https://doi.org/10.5860/choice.35-1300openalex-snapshot
Handbook of logic and language
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.201110051openalex-snapshot
Completeness and interpolation of almost‐everywhere quantification over finitely additive measures
inferred← citeshttps://doi.org/10.1007/3-540-46583-9_6openalex-snapshot
Ramsey Theory Is Needed for Solving Definability Problems of Generalized Quantifiers
inferred← citeshttps://doi.org/10.1007/978-3-319-65430-0_54openalex-snapshot
Categories of First-Order Quantifiers
inferred← citeshttps://doi.org/10.1007/978-94-017-0249-2_6openalex-snapshot
Can Majority be Supervalued?
inferred← citeshttps://doi.org/10.1007/978-94-017-0395-6_10openalex-snapshot
Features in Phonological Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-0395-6_19openalex-snapshot
Synchrony and Composition: Toward a Cognitive Architecture between Classicism and Connectionism
inferred← citeshttps://doi.org/10.1007/s00153-021-00797-0openalex-snapshot
Model theory of monadic predicate logic with the infinity quantifier
inferred← citeshttps://doi.org/10.1016/b978-0-444-53726-3.00019-0openalex-snapshot
Generalized Quantifiers in Linguistics and Logic
inferred← citeshttps://doi.org/10.1016/b978-044481714-3/50020-5openalex-snapshot
Generalized Quantifiers in Linguistics and Logic*
inferred← citeshttps://doi.org/10.1080/11663081.2021.1998742openalex-snapshot
Most-intersection of countable sets
inferred← citeshttps://doi.org/10.1093/logcom/exn014openalex-snapshot
Complete Axiomatization of Discrete-Measure Almost-Everywhere Quantification
inferred← citeshttps://doi.org/10.4018/978-1-4666-8767-7.ch002openalex-snapshot
Set-Oriented Queries in SQL
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.