On the public citation graph

Generalized quantifiers and modal logic

https://doi.org/10.1007/bf01051767
0 signed · 38 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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-4540-1openalex-snapshot
Essays in Logical Semantics
inferredcites →https://doi.org/10.1007/bf00370285openalex-snapshot
Graded modalities. III (the completeness and compactness of S40)
inferredcites →https://doi.org/10.1007/bf00379767openalex-snapshot
Graded modalities. I
inferredcites →https://doi.org/10.1007/bf00693272openalex-snapshot
Qualitative probability as an intensional logic
inferredcites →https://doi.org/10.1016/0304-3975(86)90011-3openalex-snapshot
Set containment inference and syllogisms
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7070-3openalex-snapshot
Solvable Cases of the Decision Problem
inferredcites →https://doi.org/10.1080/11663081.1991.10510775openalex-snapshot
Journal of Applied Non-Classical Logics
inferredcites →https://doi.org/10.1093/logcom/2.1.5openalex-snapshot
Using the Universal Modality: Gains and Questions
inferredcites →https://doi.org/10.1137/0206033openalex-snapshot
The Computational Complexity of Provability in Systems of Modal Propositional Logic
inferredcites →https://doi.org/10.1305/ndjfl/1093890715openalex-snapshot
In so many possible worlds.
inferredcites →https://doi.org/10.2307/2274176openalex-snapshot
Questions about quantifiers
inferredcites →https://doi.org/10.2307/2275293openalex-snapshot
The modal logic of inequality
inferredcites →https://doi.org/10.2307/2964059openalex-snapshot
W. Ackermann. Solvable cases of the decision problem. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam1954, VIII + 114 pp.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-58467-6_5openalex-snapshot
Cardinality restrictions on concepts
inferred← citeshttps://doi.org/10.1007/978-1-4613-1139-3_2openalex-snapshot
A Complete Epistemic Logic for Multiple Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-64187-0_8openalex-snapshot
Generalized Quantifiers Meet Modal Neighborhood Semantics
inferred← citeshttps://doi.org/10.1007/978-3-032-14339-6_11openalex-snapshot
Correspondence Theory of Modal Logic with Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-13824-9_9openalex-snapshot
Modal Logics with Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-35025-2_13openalex-snapshot
Crs and Guarded Logics: A Fruitful Contact
inferred← citeshttps://doi.org/10.1007/978-94-017-0522-6_11openalex-snapshot
Quantifiers in Natural Language A Survey of Some Recent Work
inferred← citeshttps://doi.org/10.1007/978-94-017-1739-7_3openalex-snapshot
Modal Logics for Representing Incoherent Knowledge
inferred← citeshttps://doi.org/10.1007/978-94-017-2798-3_14openalex-snapshot
Translating Graded Modalities into Predicate Logics
inferred← citeshttps://doi.org/10.1007/bf01050635openalex-snapshot
A modal perspective on the computational complexity of attribute value grammar
inferred← citeshttps://doi.org/10.1007/bf01057805openalex-snapshot
Directions in generalized quantifier theory
inferred← citeshttps://doi.org/10.1007/s10849-005-5786-yopenalex-snapshot
Guards, Bounds, and Generalized Semantics
inferred← citeshttps://doi.org/10.1007/s11225-024-10159-5openalex-snapshot
Modal Logic with “Most”
inferred← citeshttps://doi.org/10.1007/s11466-010-0017-2openalex-snapshot
Toward Model-Theoretic Modal Logics
inferred← citeshttps://doi.org/10.1016/j.jal.2010.08.010openalex-snapshot
Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00010-0openalex-snapshot
Cardinality restrictions on concepts
inferred← citeshttps://doi.org/10.1023/a:1005245900406openalex-snapshot
A Note on Graded Modal Logic
inferred← citeshttps://doi.org/10.1080/11663081.1997.10510916openalex-snapshot
Some considerations on the logics PFD A logic combining modality and probability
inferred← citeshttps://doi.org/10.1080/11663081.1999.10510975openalex-snapshot
Arithmetizations of Syllogistic à la Leibniz
inferred← citeshttps://doi.org/10.1093/jigpal/jzae079openalex-snapshot
Axiomatization of modal logic with counting
inferred← citeshttps://doi.org/10.1109/conisoft63288.2024.00037openalex-snapshot
A Reasoning System for Graded Modal Logic
inferred← citeshttps://doi.org/10.1305/ndjfl/1039293062openalex-snapshot
Interpolation and Preservation in ${\cal M\kern-1pt L}_{\omega_1}$
inferred← citeshttps://doi.org/10.1305/ndjfl/1040067313openalex-snapshot
Multi-Dimensional Semantics for Modal Logics
inferred← citeshttps://doi.org/10.70675/3a23b5f9z537cz4dd0z9fd8z42fe13aeb3abopenalex-snapshot
Reasoning Tasks for Hybrid Logics
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.