On the public citation graph

A metacompleteness theorem for contraction-free relevant logics

https://doi.org/10.1007/bf00935747
0 signed · 60 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.1305/ndjfl/1093887722openalex-snapshot
Metacompleteness.

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-030-25365-3_3openalex-snapshot
The Number of Logical Values
inferred← citeshttps://doi.org/10.1007/978-3-031-45558-2_18openalex-snapshot
Hyperintensionality in Relevant Logics
inferred← citeshttps://doi.org/10.1007/978-3-319-29300-4_9openalex-snapshot
Comparing Contents with Information
inferred← citeshttps://doi.org/10.1007/978-3-319-74772-9_13openalex-snapshot
Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
inferred← citeshttps://doi.org/10.1007/978-81-322-2719-9_17openalex-snapshot
Logic—The Big Picture
inferred← citeshttps://doi.org/10.1007/978-94-007-6958-8_18openalex-snapshot
Logic
inferred← citeshttps://doi.org/10.1007/978-94-015-9309-0_3openalex-snapshot
Negation in Relevant Logics (How I Stopped Worrying and Learned to Love the Routley Star)
inferred← citeshttps://doi.org/10.1007/bf00247002openalex-snapshot
Relevant implication and the case for a weaker logic
inferred← citeshttps://doi.org/10.1007/bf00249365openalex-snapshot
TW + and RW + are decidable
inferred← citeshttps://doi.org/10.1007/bf00260931openalex-snapshot
Modal translations in substructural logics
inferred← citeshttps://doi.org/10.1007/bf00370629openalex-snapshot
Completeness and conservative extension results for some boolean relevant logics
inferred← citeshttps://doi.org/10.1007/bf00454743openalex-snapshot
Gentzenization and decidability of some contraction-less relevant logics
inferred← citeshttps://doi.org/10.1007/s10670-026-01120-0openalex-snapshot
Constructivism and Relevance
inferred← citeshttps://doi.org/10.1007/s10992-010-9129-3openalex-snapshot
Free Semantics
inferred← citeshttps://doi.org/10.1007/s10992-012-9262-2openalex-snapshot
The Simple Consistency of Naive Set Theory using Metavaluations
inferred← citeshttps://doi.org/10.1007/s10992-018-9493-yopenalex-snapshot
Notes on Stratified Semantics
inferred← citeshttps://doi.org/10.1007/s10992-022-09655-7openalex-snapshot
What is a Relevant Connective?
inferred← citeshttps://doi.org/10.1007/s10992-025-09791-wopenalex-snapshot
Symmetry and Completeness in Relevant Epistemic Logic
inferred← citeshttps://doi.org/10.1007/s10992-026-09840-yopenalex-snapshot
The Disjunction Property for Operational Relevance Logics
inferred← citeshttps://doi.org/10.1007/s11225-011-9306-6openalex-snapshot
The γ-admissibility of Relevant Modal Logics I — The Method of Normal Models
inferred← citeshttps://doi.org/10.1007/s11225-011-9315-5openalex-snapshot
The γ-admissibility of Relevant Modal Logics II — The Method using Metavaluations
inferred← citeshttps://doi.org/10.1007/s11225-012-9433-8openalex-snapshot
Some Metacomplete Relevant Modal Logics
inferred← citeshttps://doi.org/10.1007/s11225-012-9458-zopenalex-snapshot
Metacompleteness of Substructural Logics
inferred← citeshttps://doi.org/10.1007/s11225-012-9459-yopenalex-snapshot
An Algebraic Proof of the Admissibility of γ in Relevant Modal Logics
inferred← citeshttps://doi.org/10.1007/s11229-017-1362-7openalex-snapshot
The use of definitions and their logical representation in paradox derivation
inferred← citeshttps://doi.org/10.1007/s11229-025-05245-7openalex-snapshot
On the hyperintensionality of relevant logics and some of their rivals
inferred← citeshttps://doi.org/10.1007/s44204-023-00083-1openalex-snapshot
No cause for collapse
inferred← citeshttps://doi.org/10.1016/s0049-237x(07)80016-4openalex-snapshot
Semisimplicity
inferred← citeshttps://doi.org/10.1016/s0049-237x(13)70005-3openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/9781009227773openalex-snapshot
Relevance Logic
inferred← citeshttps://doi.org/10.1017/bsl.2017.29openalex-snapshot
METAVALUATIONS
inferred← citeshttps://doi.org/10.1017/s1755020309990219openalex-snapshot
FOUR BASIC LOGICAL ISSUES
inferred← citeshttps://doi.org/10.1017/s1755020325100762openalex-snapshot
MODELS FOR OFFICIAL ENTAILMENT
inferred← citeshttps://doi.org/10.1080/00048409612347591openalex-snapshot
A dilemma for Priest's dialethism?
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199265176.003.0003openalex-snapshot
On the Formalization of the Law of Non-Contradiction
inferred← citeshttps://doi.org/10.1093/analys/ant043openalex-snapshot
Recent Work in Relevant Logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzaa019openalex-snapshot
Boolean negation and non-conservativity I: Relevant modal logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzab031openalex-snapshot
The relevance logic of Boolean groups
inferred← citeshttps://doi.org/10.1093/jigpal/jzu009openalex-snapshot
A cut-free sequent calculus for relevant logic RW
inferred← citeshttps://doi.org/10.1093/logcom/exac057openalex-snapshot
Weak relevant justification logics
inferred← citeshttps://doi.org/10.1215/00294527-2021-0035openalex-snapshot
An Incompleteness Theorem for Modal Relevant Logics
inferred← citeshttps://doi.org/10.12775/llp.2024.021openalex-snapshot
Simplified Semantics for Further Relevant Logics I
inferred← citeshttps://doi.org/10.1305/ndjfl/1093634408openalex-snapshot
Real reduced models for relevant logics without ${\rm WI}$.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093637560openalex-snapshot
Reduced models for relevant logics without ${\rm WI}$.
inferred← citeshttps://doi.org/10.1305/ndjfl/1193667706openalex-snapshot
An Algebraic Approach to the Disjunction Property of Substructural Logics
inferred← citeshttps://doi.org/10.2178/jsl/1140641162openalex-snapshot
Normalized natural deduction systems for some relevant logics I: The logic DW
inferred← citeshttps://doi.org/10.2307/2275666openalex-snapshot
Gentzenizations of relevant logics without distribution. I
inferred← citeshttps://doi.org/10.2307/2275667openalex-snapshot
Gentzenizations of relevant logics without distribution. II
inferred← citeshttps://doi.org/10.2307/2275668openalex-snapshot
Gentzenizations of relevant logics with distribution
inferred← citeshttps://doi.org/10.26181/22559581openalex-snapshot
Some concerns regarding ternary-relation semantics and truth-theoretic semantics in general
inferred← citeshttps://doi.org/10.26686/ajl.v15i2.4863openalex-snapshot
Starting the Dismantling of Classical Mathematics
inferred← citeshttps://doi.org/10.26686/ajl.v18i5.6920openalex-snapshot
Arithmetic Formulated in a Logic of Meaning Containment
inferred← citeshttps://doi.org/10.26686/ajl.v18i6.7081openalex-snapshot
Strong Depth Relevance
inferred← citeshttps://doi.org/10.26686/ajl.v1i0.1760openalex-snapshot
Semantic Decision Procedures for Some Relevant Logics
inferred← citeshttps://doi.org/10.26686/ajl.v21i3.8292openalex-snapshot
The Law of Excluded Middle and Berry’s Paradox... Finally
inferred← citeshttps://doi.org/10.26686/ajl.v29i2.8287openalex-snapshot
In Support of Valerie Plumwood
inferred← citeshttps://doi.org/10.26686/ajl.v6i0.1793openalex-snapshot
A Rejection System for the First-Degree Formulae of some Relevant Logics
inferred← citeshttps://doi.org/10.26686/ajl.v8i0.1811openalex-snapshot
Extending Metacompleteness to Systems with Classical Formulae
inferred← citeshttps://doi.org/10.4324/9780203016244openalex-snapshot
An Introduction to Substructural Logics
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.