On the public citation graph

The contraction rule and decision problems for logics without structural rules

https://doi.org/10.1007/bf00370189
0 signed · 27 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.19650110403openalex-snapshot
A Decision Procedure For the System EĪ of Entailment with Negation
inferredcites →https://doi.org/10.1007/3-540-52753-2_44openalex-snapshot
A predicate calculus with control of derivations
inferredcites →https://doi.org/10.1007/978-1-4613-0609-2_8openalex-snapshot
Structural Rules and a Logical Hierarchy
inferredcites →https://doi.org/10.1007/978-94-009-5203-4_3openalex-snapshot
Relevance Logic and Entailment
inferredcites →https://doi.org/10.1007/978-94-009-5203-4_4openalex-snapshot
Intuitionistic Logic
inferredcites →https://doi.org/10.1007/bf00370272openalex-snapshot
Predicate logics without the structure rules
inferredcites →https://doi.org/10.1007/bfb0014972openalex-snapshot
Linear logic and lazy computation
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0049-237x(08)71540-4openalex-snapshot
Intuitionism, Entailment, Negation
inferredcites →https://doi.org/10.2307/2964568openalex-snapshot
A completeness theorem in modal logic
inferredcites →https://doi.org/10.2307/2964754openalex-snapshot
Modalities in Ackermann's “rigorous implication”

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.200810013openalex-snapshot
Interpolation via translations
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_20openalex-snapshot
On the Undecidability of Some Sub-classical First-Order Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-87803-2_21openalex-snapshot
Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials
inferred← citeshttps://doi.org/10.1007/978-94-017-2109-7_13openalex-snapshot
Some Observations on Noncommutative Substructural Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-3598-8_8openalex-snapshot
Substructural Logics and Residuated Lattices — an Introduction
inferred← citeshttps://doi.org/10.1007/bfb0055769openalex-snapshot
Proof theory of fuzzy logics: Urquhart's C and related logics
inferred← citeshttps://doi.org/10.1007/s10992-020-09589-yopenalex-snapshot
Towards a Non-classical Meta-theory for Substructural Approaches to Paradox
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103509openalex-snapshot
Universal proof theory: Semi-analytic rules and Craig interpolation
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/jsl.2015.18openalex-snapshot
FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE
inferred← citeshttps://doi.org/10.1017/s175502031400015xopenalex-snapshot
UNIFORM INTERPOLATION IN SUBSTRUCTURAL LOGICS
inferred← citeshttps://doi.org/10.1023/a:1016500922708openalex-snapshot
Kripke Semantics, Undecidability and Standard Completeness for Esteva and Godo's Logic MTL∀
inferred← citeshttps://doi.org/10.1145/3373718.3394802openalex-snapshot
Extended Kripke lemma and decidability for hypersequent substructural logics
inferred← citeshttps://doi.org/10.1305/ndjfl/1094061862openalex-snapshot
Extending intuitionistic linear logic with knotted structural rules.
inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c060openalex-snapshot
Proof-Theoretic Methods in Nonclassical Logic --an Introduction
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.