On the public citation graph
A theory of restricted quantification I
0 signed · 29 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/978-3-540-89107-9_6openalex-snapshot
Grundlagen der Mathematik
inferredcites →https://doi.org/10.1007/bf01448954openalex-snapshot
�ber deduktive Theorien mit mehreren Sorten von Grunddingen
inferredcites →https://doi.org/10.1007/bf02054948openalex-snapshot
Die Zulässigkeit der Behandlung mehrsortiger Theorien mittels der üblichen einsortigen Prädikatenlogik
inferredcites →https://doi.org/10.1016/s0049-237x(09)x7012-6openalex-snapshot
Mathematical Interpretation of Formal Systems
inferredcites →https://doi.org/10.2307/2266970openalex-snapshot
Existence of classes and value specification of variables
inferredcites →https://doi.org/10.2307/2267402openalex-snapshot
Quantification theory and empty individual-domains
inferredcites →https://doi.org/10.2307/2268091openalex-snapshot
K. Jaakko J. Hintikka. Distributive normal forms in the calculus of predicates. Acta philosophica fennica, no. 6. Helsinki1953, 71 pp. With separate sheet of Corrections.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-94-009-0687-7_18openalex-snapshot
On Logical Analysis of Ordinary Sentences
inferred← citeshttps://doi.org/10.1007/bf00128778openalex-snapshot
Taxonomic reasoning with many-sorted logics
inferred← citeshttps://doi.org/10.1007/bf00243207openalex-snapshot
A more expressive formulation of many sorted logic
inferred← citeshttps://doi.org/10.1007/bf00542649openalex-snapshot
Natural deduction and arbitrary objects
inferred← citeshttps://doi.org/10.1007/bf01063841openalex-snapshot
Subject-predicate calculus free from existential import
inferred← citeshttps://doi.org/10.1007/s11225-014-9564-1openalex-snapshot
Gentzen and Jaśkowski Natural Deduction: Fundamentally Similar but Importantly Different
inferred← citeshttps://doi.org/10.1016/0004-3702(85)90029-3openalex-snapshot
A mechanical solution of Schubert's Steamroller by many-sorted resolution
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90055-3openalex-snapshot
An order-sorted logic for knowledge representation systems
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90027-2openalex-snapshot
A resolution principle for constrained logics
inferred← citeshttps://doi.org/10.1016/c2013-0-11758-8openalex-snapshot
A Many-Sorted Calculus Based on Resolution and Paramodulation
inferred← citeshttps://doi.org/10.1016/s1385-7258(70)80001-4openalex-snapshot
On the underlying logic of two systems of set theory
inferred← citeshttps://doi.org/10.1017/s0041977x0014902xopenalex-snapshot
Correlations Between Language and Logic in Indian Thought
inferred← citeshttps://doi.org/10.1109/tai.1989.65343openalex-snapshot
The NVL knowledge representation language
inferred← citeshttps://doi.org/10.1111/j.1755-2567.1962.tb00326.xopenalex-snapshot
A note concerning the binary quantifiers
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.