On the public citation graph
Relevant analytic tableaux
0 signed · 50 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.
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.
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/bf00373152openalex-snapshot
Intuitive semantics for first-degree entailments and ?coupled trees?
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bf02120525openalex-snapshot
Conservative extension in relevant implication
inferredcites →https://doi.org/10.1007/bfb0062936openalex-snapshot
Tableau Systems for First Order Number Theory and Certain Higher Order Theories
inferredcites →https://doi.org/10.1016/0016-0032(63)90672-0openalex-snapshot
Foundations of mathematical logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)70742-0openalex-snapshot
Abstract Quantification Theory
inferredcites →https://doi.org/10.1016/s0049-237x(08)71541-6openalex-snapshot
The Semantics of Entailment
inferredcites →https://doi.org/10.1016/s0049-237x(08)71543-xopenalex-snapshot
A Generalization of Intuitionistic and Modal Logics
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7039-9openalex-snapshot
The Collected Papers of Gerhard Gentzen
inferredcites →https://doi.org/10.1073/pnas.49.6.828openalex-snapshot
A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY
inferredcites →https://doi.org/10.1111/j.1468-0149.1964.tb00868.xopenalex-snapshot
ACTA PHILOSOPHICA FENNICA
inferredcites →https://doi.org/10.1305/ndjfl/1093888127openalex-snapshot
Modal trees for ${\rm T}$ and ${\rm S}5$.
inferredcites →https://doi.org/10.1305/ndjfl/1093894722openalex-snapshot
Tableau methods of proof for modal logics.
inferredcites →https://doi.org/10.2307/2219366openalex-snapshot
Entailment. The Logic of Relevance and Necessity. Volume I.
inferredcites →https://doi.org/10.2307/2270449openalex-snapshot
Finite nest structures and propositional logic
inferredcites →https://doi.org/10.2307/2964568openalex-snapshot
A completeness theorem in modal logic
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.19790253203openalex-snapshot
A Note on the Admissibility of Cut in Relevant Tableau Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_2openalex-snapshot
Relevance-Sensitive Truth-Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_1openalex-snapshot
On Combinatorial Proofs for Logics of Relevance and Entailment
inferred← citeshttps://doi.org/10.1007/978-94-009-5203-4_3openalex-snapshot
Relevance Logic and Entailment
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_11openalex-snapshot
A Bibliography on Analytic Tableaux Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_7openalex-snapshot
Tableau Methods for Substructural Logics
inferred← citeshttps://doi.org/10.1007/bf00881958openalex-snapshot
A generalization of analytic deduction via labelled deductive systems. Part I: Basic substructural logics
inferred← citeshttps://doi.org/10.1007/bfb0012833openalex-snapshot
Towards efficient "knowledge-based" automated theorem proving for non-standard logics
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80030-0openalex-snapshot
Relevant and substructural logics
inferred← citeshttps://doi.org/10.1017/s1755020319000388openalex-snapshot
CUT AND GAMMA I: PROPOSITIONAL AND CONSTANT DOMAIN R
inferred← citeshttps://doi.org/10.1080/00048408212340551openalex-snapshot
Multisets and relevant implication I
inferred← citeshttps://doi.org/10.1111/phc3.12965openalex-snapshot
Routes to relevance: Philosophies of relevant logics
inferred← citeshttps://doi.org/10.2307/2273579openalex-snapshot
Meeting of the Association for Symbolic Logic, San Francisco, 1981
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/2275375openalex-snapshot
Relational proof system for relevant logics
inferred← citeshttps://doi.org/10.25911/5d7a2ba742b8copenalex-snapshot
Investigations into Satisfiability Search
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.