On the public citation graph

The completeness of S

0 signed · 30 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/10992.1573-0433openalex-snapshot
Journal of Philosophical Logic
inferredcites →https://doi.org/10.1007/bf00263359openalex-snapshot
A semantical theory of analytic implication
inferredcites →https://doi.org/10.1007/bf01699094openalex-snapshot
Ergebnisse eines mathematischen Kolloquiums
inferredcites →https://doi.org/10.1007/bf02120878openalex-snapshot
A Kripke-style semantics for R-Mingle using a binary accessibility relation
inferredcites →https://doi.org/10.1016/s0049-237x(08)71541-6openalex-snapshot
The Semantics of Entailment
inferredcites →https://doi.org/10.1017/s0022481200092161openalex-snapshot
Algebraic completeness results for R-mingle and its extensions
inferredcites →https://doi.org/10.1305/ndjfl/1093894715openalex-snapshot
A modification of Parry's analytic implication.

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-3-319-70821-8_2openalex-snapshot
Nonsense and Proscription
inferred← citeshttps://doi.org/10.1007/978-3-319-70821-8_5openalex-snapshot
Faulty Belnap Computers and Subsystems of $$\mathsf{E}_{\texttt {fde}}$$ E fde
inferred← citeshttps://doi.org/10.1007/978-3-319-70821-8_7openalex-snapshot
Correia Semantics Revisited
inferred← citeshttps://doi.org/10.1007/bf00297573openalex-snapshot
Paraconsistent analytic implication
inferred← citeshttps://doi.org/10.1007/bf00379764openalex-snapshot
A note on the decidability of a strong relevant logic
inferred← citeshttps://doi.org/10.1007/s10670-025-00978-wopenalex-snapshot
Contextual Entailment and Containment: A Ternary Approach to Information and Topic Inclusion
inferred← citeshttps://doi.org/10.1007/s10992-014-9321-yopenalex-snapshot
Logics of Nonsense and Parry Systems
inferred← citeshttps://doi.org/10.1007/s11098-023-01952-4openalex-snapshot
Subject-matter and intensional operators I: conditional-agnostic analytic implication
inferred← citeshttps://doi.org/10.1007/s11225-015-9631-2openalex-snapshot
Correia Semantics Revisited
inferred← citeshttps://doi.org/10.1007/s11225-016-9695-7openalex-snapshot
Rivals to Belnap–Dunn Logic on Interlaced Trilattices
inferred← citeshttps://doi.org/10.1007/s11229-024-04863-xopenalex-snapshot
Relevant epistemic logic with state-sensitive topics
inferred← citeshttps://doi.org/10.1007/s11229-025-04981-0openalex-snapshot
Formalizing the conditionals of Diodorus Cronus and Chrysippus: logic and potential applications in human thinking
inferred← citeshttps://doi.org/10.1017/s1755020323000230openalex-snapshot
SUBJECT-MATTER AND INTENSIONAL OPERATORS III: STATE-SENSITIVE SUBJECT-MATTER AND TOPIC SUFFICIENCY
inferred← citeshttps://doi.org/10.1023/a:1022301711366openalex-snapshot
Fibring Non-Truth-Functional Logics: Completeness Preservation
inferred← citeshttps://doi.org/10.1080/11663081.2014.980116openalex-snapshot
A computational interpretation of conceptivism
inferred← citeshttps://doi.org/10.1080/11663081.2020.1751573openalex-snapshot
Exactly true and non-falsity logics meeting infectious ones
inferred← citeshttps://doi.org/10.1093/logcom/exu048openalex-snapshot
Faulty Belnap computers and subsystems of FDE
inferred← citeshttps://doi.org/10.1109/ismvl.2015.14openalex-snapshot
Cut-Down Operations on Bilattices
inferred← citeshttps://doi.org/10.1109/ismvl60454.2024.00025openalex-snapshot
Counterexample Sufficiency in Modifications to Strict-Tolerant Logics
inferred← citeshttps://doi.org/10.1215/00294527-2023-0019openalex-snapshot
Topic-Theoretic Extensions of Analytic Implication
inferred← citeshttps://doi.org/10.2307/2274123openalex-snapshot
Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.26686/ajl.v15i2.4864openalex-snapshot
Relevant Logics Obeying Component Homogeneity
inferred← citeshttps://doi.org/10.2977/prims/1195176248openalex-snapshot
Solutions for Forte's Conjectures
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.