On the public citation graph

Predicate logics without the structure rules

https://doi.org/10.1007/bf00370272
0 signed · 32 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/bf00379766openalex-snapshot
Semantical analysis of predicate logics without the contraction rule
inferredcites →https://doi.org/10.1007/bf01881545openalex-snapshot
A new semantics for intuitionistic predicate logic
inferredcites →https://doi.org/10.1016/0304-3975(84)90047-1openalex-snapshot
A decidable fragment of predicate calculus
inferredcites →https://doi.org/10.2307/2273798openalex-snapshot
Logics without the contraction rule

What points at this work

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

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/3-540-52753-2_44openalex-snapshot
A predicate calculus with control of derivations
inferred← citeshttps://doi.org/10.1007/978-1-4613-0609-2_8openalex-snapshot
Structural Rules and a Logical Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-319-40220-8_12openalex-snapshot
On the Methodology of Paraconsistent Logic
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-3-642-23863-5_24openalex-snapshot
A Decidable First-Order Logic for Medical Reasoning
inferred← citeshttps://doi.org/10.1007/bf00260931openalex-snapshot
Modal translations in substructural logics
inferred← citeshttps://doi.org/10.1007/bf00370189openalex-snapshot
The contraction rule and decision problems for logics without structural rules
inferred← citeshttps://doi.org/10.1007/bf01057936openalex-snapshot
Syntactical investigations intoBI logic andBB?I logic
inferred← citeshttps://doi.org/10.1007/bf01188178openalex-snapshot
On the structure of varieties with equationally definable principal congruences IV
inferred← citeshttps://doi.org/10.1007/bf01195727openalex-snapshot
On the structure of varieties with equationally definable principal congruences III
inferred← citeshttps://doi.org/10.1007/bf02674609openalex-snapshot
On a fragment of intuitionistic logic which is complete with respect to the kripke frames with finite domains
inferred← citeshttps://doi.org/10.1007/s10849-009-9101-1openalex-snapshot
Dynamic Non-Commutative Logic
inferred← citeshttps://doi.org/10.1007/s10992-013-9290-6openalex-snapshot
Algebraic Kripke-Style Semantics for Relevance 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.1007/s10992-025-09799-2openalex-snapshot
Proof theory of Abelian connexive logics
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.1023/b:stud.0000037127.15182.2aopenalex-snapshot
Algebraic Aspects of Cut Elimination
inferred← citeshttps://doi.org/10.12775/llp.2009.007openalex-snapshot
Temporal non-commutative logic: Expressing time, resource, order and hierarchy
inferred← citeshttps://doi.org/10.1305/ndjfl/1094061862openalex-snapshot
Extending intuitionistic linear logic with knotted structural rules.
inferred← citeshttps://doi.org/10.2307/2275004openalex-snapshot
European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988
inferred← citeshttps://doi.org/10.2307/2586689openalex-snapshot
On the role of implication in formal logic
inferred← citeshttps://doi.org/10.2307/421084openalex-snapshot
1999 European Summer Meeting of the Association for Symbolic Logic
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.