On the public citation graph

The logic of ?Almost all?

https://doi.org/10.1007/bf00652068
0 signed · 33 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/bf00485654openalex-snapshot
The logic of inexact concepts
inferredcites →https://doi.org/10.1007/bf01969703openalex-snapshot
Überfür-fast-alle-Quantoren
inferredcites →https://doi.org/10.1016/s0019-9958(65)90241-xopenalex-snapshot
Fuzzy sets
inferredcites →https://doi.org/10.1016/s0049-237x(08)71673-2openalex-snapshot
Probability and the Logic of Conditionals

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.19800261406openalex-snapshot
Cylindric Algebras with Filter Quantifiers
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/978-3-642-13321-3_5openalex-snapshot
The Logic of Large Enough
inferred← citeshttps://doi.org/10.1007/978-94-010-1161-7_6openalex-snapshot
Local and Fuzzy Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-1737-3_8openalex-snapshot
Probabilistic Satisfiability
inferred← citeshttps://doi.org/10.1007/bf00248572openalex-snapshot
On the logic of high probability
inferred← citeshttps://doi.org/10.1007/bf00263317openalex-snapshot
A truth-functional logic for near-universal generalizations
inferred← citeshttps://doi.org/10.1007/bf00485054openalex-snapshot
Truth and entailment for a vague quantifier
inferred← citeshttps://doi.org/10.1007/bf00485943openalex-snapshot
Continuity and idealizability of approximate generalizations
inferred← citeshttps://doi.org/10.1007/s10516-017-9338-2openalex-snapshot
The Logic of “Most” and “Mostly”
inferred← citeshttps://doi.org/10.1007/s10838-020-09505-7openalex-snapshot
Typicality and Minutis Rectis Laws: From Physics to Sociology
inferred← citeshttps://doi.org/10.1007/s11229-005-9078-5openalex-snapshot
On A Proportionality Analysis of Syllogistic Private Reasoning
inferred← citeshttps://doi.org/10.1016/0004-3702(87)90013-0openalex-snapshot
Some quantifiers require two-predicate scopes
inferred← citeshttps://doi.org/10.1016/0020-0255(75)90017-1openalex-snapshot
The concept of a linguistic variable and its application to approximate reasoning-III
inferred← citeshttps://doi.org/10.1016/0020-0255(75)90046-8openalex-snapshot
The concept of a linguistic variable and its application to approximate reasoning—II
inferred← citeshttps://doi.org/10.1016/0022-2496(79)90017-8openalex-snapshot
Representing approximate ordering and equivalence relations
inferred← citeshttps://doi.org/10.1016/0898-1221(83)90013-5openalex-snapshot
A computational approach to fuzzy quantifiers in natural languages
inferred← citeshttps://doi.org/10.1016/b978-0-08-030253-9.50016-0openalex-snapshot
A COMPUTATIONAL APPROACH TO FUZZY QUANTIFIERS IN NATURAL LANGUAGES††Research supported in part by the NSF Grants IST-8018196 and MCS79–06543.
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1450-4.50007-9openalex-snapshot
FUZZY SETS
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00020-9openalex-snapshot
Dynamic reasoning with qualified syllogisms
inferred← citeshttps://doi.org/10.1016/s0020-7373(77)80042-4openalex-snapshot
The fuzzy decade: a bibliography of fuzzy systems and closely related topics
inferred← citeshttps://doi.org/10.1017/s1755020312000184openalex-snapshot
REWARD VERSUS RISK IN UNCERTAIN INFERENCE: THEOREMS AND SIMULATIONS
inferred← citeshttps://doi.org/10.1023/a:1005090932292openalex-snapshot
Idealization in Applied First-Order Logic
inferred← citeshttps://doi.org/10.1086/289654openalex-snapshot
Approximate Truth and Scientific Realism
inferred← citeshttps://doi.org/10.1086/psaprocbienmeetp.1982.1.192667openalex-snapshot
Approximate Generalizations and their Idealization
inferred← citeshttps://doi.org/10.1086/psaprocbienmeetp.1988.1.192963openalex-snapshot
Confirming Inexact Generalizations
inferred← citeshttps://doi.org/10.1093/logcom/exn014openalex-snapshot
Complete Axiomatization of Discrete-Measure Almost-Everywhere Quantification
inferred← citeshttps://doi.org/10.1109/21.328929openalex-snapshot
Probabilistic entailment of conditionals by conditionals
inferred← citeshttps://doi.org/10.1515/jisys.1998.8.3-4.315openalex-snapshot
Time, Nonmonotonicity, Qualified Syllogisms, and the Frame Problem
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.