On the public citation graph

Rules in relevant logic ? II: Formula representation

https://doi.org/10.1007/bf01053260
0 signed · 20 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.19600060709openalex-snapshot
Completeness Theorems for the Systems E of Entailment and EQ of Entailment with Quantification
inferredcites →https://doi.org/10.1002/malq.19730190306openalex-snapshot
Deduction Theorems for Relevant Logics
inferredcites →https://doi.org/10.1002/malq.19760220135openalex-snapshot
Deduction Theorems for T, E and R Reconsidered
inferredcites →https://doi.org/10.1007/978-94-009-5203-4_3openalex-snapshot
Relevance Logic and Entailment
inferredcites →https://doi.org/10.1007/bf00211185openalex-snapshot
The gentzenization and decidability of RW
inferredcites →https://doi.org/10.1007/bf00454743openalex-snapshot
Gentzenization and decidability of some contraction-less relevant logics
inferredcites →https://doi.org/10.1007/bf01050340openalex-snapshot
Rules in relevant logic - I: Semantic classification
inferredcites →https://doi.org/10.1080/00048408212340551openalex-snapshot
Multisets and relevant implication I
inferredcites →https://doi.org/10.1305/ndjfl/1093891202openalex-snapshot
Completeness of relevant quantification theories.
inferredcites →https://doi.org/10.2307/2274261openalex-snapshot
The undecidability of entailment and relevant 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-031-69940-5_13openalex-snapshot
Entailment Generalized
inferred← citeshttps://doi.org/10.1007/978-3-031-69940-5_4openalex-snapshot
Withered Relevance
inferred← citeshttps://doi.org/10.1007/bf00247002openalex-snapshot
Relevant implication and the case for a weaker logic
inferred← citeshttps://doi.org/10.1007/s10992-026-09842-wopenalex-snapshot
An Inquiry into the Logic subDLQ
inferred← citeshttps://doi.org/10.1007/s11229-021-03065-zopenalex-snapshot
Non-Boolean classical relevant logics II: Classicality through truth-constants
inferred← citeshttps://doi.org/10.1017/s1755020309990219openalex-snapshot
FOUR BASIC LOGICAL ISSUES
inferred← citeshttps://doi.org/10.1093/jigpal/jzaa021openalex-snapshot
Boolean negation and non-conservativity III: the Ackermann constant
inferred← citeshttps://doi.org/10.12775/llp.2012.008openalex-snapshot
Logic or reason?
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.