On the public citation graph

Rules in relevant logic - I: Semantic classification

https://doi.org/10.1007/bf01050340
0 signed · 18 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.1002/malq.19730190306openalex-snapshot
Deduction Theorems for Relevant Logics
inferredcites →https://doi.org/10.1007/978-94-010-2191-3_13openalex-snapshot
Rules and Derived Rules
inferredcites →https://doi.org/10.1007/bf00211185openalex-snapshot
The gentzenization and decidability of RW
inferredcites →https://doi.org/10.1007/bf00249674openalex-snapshot
Semantics for quantified relevance logic
inferredcites →https://doi.org/10.1007/bf00454743openalex-snapshot
Gentzenization and decidability of some contraction-less relevant logics
inferredcites →https://doi.org/10.1016/s0049-237x(09)70492-6openalex-snapshot
Problems and Solutions in the Semantics of Quantified Relevant Logics. I.
inferredcites →https://doi.org/10.1305/ndjfl/1093890710openalex-snapshot
The completeness of $S1$ and some related systems.
inferredcites →https://doi.org/10.2307/2270909openalex-snapshot
E, R AND γ

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-017-0460-1_1openalex-snapshot
Relevance Logic
inferred← citeshttps://doi.org/10.1007/978-981-96-8566-0_3openalex-snapshot
Ignorance and the Possibility of Error in Relevant Epistemic Logic
inferred← citeshttps://doi.org/10.1007/bf00247002openalex-snapshot
Relevant implication and the case for a weaker logic
inferred← citeshttps://doi.org/10.1007/bf01053260openalex-snapshot
Rules in relevant logic ? II: Formula representation
inferred← citeshttps://doi.org/10.1007/s10992-014-9336-4openalex-snapshot
External Curries
inferred← citeshttps://doi.org/10.1007/s11225-005-0106-8openalex-snapshot
Fragments of R-Mingle
inferred← citeshttps://doi.org/10.1093/jigpal/jzn017openalex-snapshot
Replacing Modus Ponens With One-Premiss Rules
inferred← citeshttps://doi.org/10.1215/00294527-2021-0035openalex-snapshot
An Incompleteness Theorem for Modal Relevant Logics
inferred← citeshttps://doi.org/10.26686/ajl.v18i2.6770openalex-snapshot
From Hilbert proofs to consecutions and back
inferred← citeshttps://doi.org/10.31577/orgf.2019.26303openalex-snapshot
Semantics without Toil? Brady and Rush Meet Hallden
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.