On the public citation graph
The deducibilities of S5
0 signed · 34 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.1007/978-94-010-9614-0_17openalex-snapshot
Calculi of Pure Strict Implication
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bf01699094openalex-snapshot
Ergebnisse eines mathematischen Kolloquiums
inferredcites →https://doi.org/10.1007/bf02120534openalex-snapshot
The deduction theorems valid in certain fragments of the Lewis' system S2 and the system T of Feys-von Wright
inferredcites →https://doi.org/10.1007/bf02124617openalex-snapshot
A note on deduction theorem for Gödel's propositional calculus G4
inferredcites →https://doi.org/10.1007/bf02272272openalex-snapshot
Uber die Regeln des Aussagenkalkuls
inferredcites →https://doi.org/10.1016/s1385-7258(58)50024-9openalex-snapshot
Remarks on sentential logics
inferredcites →https://doi.org/10.1017/s0305004100033120openalex-snapshot
On the existence of finite models and decision procedures for propositional calculi
inferredcites →https://doi.org/10.1305/ndjfl/1093882797openalex-snapshot
A generalized theorem concerning a restricted rule of substitution in the field of propositional calculi.
inferredcites →https://doi.org/10.2307/2268135openalex-snapshot
Some theorems about the sentential calculi of Lewis and Heyting
inferredcites →https://doi.org/10.2307/2269810openalex-snapshot
Algebraic semantics for modal logics II
inferredcites →https://doi.org/10.2307/2270054openalex-snapshot
On the scope of the classical deduction theorem
inferredcites →https://doi.org/10.2307/2314315openalex-snapshot
Recherches sur la Theorie Generale des Systemes Formels.
inferredcites →https://doi.org/10.3406/phlou.1950.4310openalex-snapshot
Les systèmes formalisés des modalités aristotéliciennes
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-47921-2_7openalex-snapshot
About the Unification Types of Modal Logics
inferred← citeshttps://doi.org/10.1007/bf00968695openalex-snapshot
Admissible rules for logics containing S4.3
inferred← citeshttps://doi.org/10.1007/bf01982031openalex-snapshot
A criterion for admissibility of rules in the model system S4 and the intuitionistic logic
inferred← citeshttps://doi.org/10.1007/s10469-024-09733-6openalex-snapshot
An Explicit Basis for WCP-Globally Admissible Inference Rules
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71888-3openalex-snapshot
Fifty Years of Deduction Theorems
inferred← citeshttps://doi.org/10.1070/im1987v028n03abeh000902openalex-snapshot
DECIDABILITY OF ADMISSIBILITY IN THE MODAL SYSTEM Grz AND IN INTUITIONISTIC LOGIC
inferred← citeshttps://doi.org/10.1093/jigpal/jzy077openalex-snapshot
Unification in first-order transitive modal logic
inferred← citeshttps://doi.org/10.1134/s0037446624010142openalex-snapshot
Admissible Inference Rules of Modal WCP-Logics
inferred← citeshttps://doi.org/10.1305/ndjfl/1027953481openalex-snapshot
An Intriguing Logic with Two Implicational Connectives
inferred← citeshttps://doi.org/10.18778/0138-0680.44.1.2.04openalex-snapshot
An Observation Concerning Porte’s Rule in Modal Logic
inferred← citeshttps://doi.org/10.2307/2273325openalex-snapshot
Antitheses in systems of relevant implication
inferred← citeshttps://doi.org/10.4213/dm1161openalex-snapshot
Построение явного базиса для допустимых правил вывода модальных логик, расширяющих $S4.1$
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.