On the public citation graph
Derivability of admissible rules
0 signed · 62 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/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bf01988049openalex-snapshot
Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül
inferredcites →https://doi.org/10.1305/ndjfl/1093957658openalex-snapshot
On not strengthening intuitionistic 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.19930390144openalex-snapshot
Intermediate logics preserving admissible inference rules of heyting calculus
inferred← citeshttps://doi.org/10.1002/malq.201600046openalex-snapshot
Algebraic semantics for the ‐fragment of and its properties
inferred← citeshttps://doi.org/10.1002/malq.201900012openalex-snapshot
Singly generated quasivarieties and residuated structures
inferred← citeshttps://doi.org/10.1007/11753728_33openalex-snapshot
Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_34openalex-snapshot
Quasi-characteristic inference rules for modal logics
inferred← citeshttps://doi.org/10.1007/978-3-030-94926-6_1openalex-snapshot
Popper’s Theory of Deductive Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-27683-0_6openalex-snapshot
Multiple Conclusion Rules in Logics with the Disjunction Property
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_34openalex-snapshot
Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-15390-7_23openalex-snapshot
Reasoning and Inference Rules in Basic Linear Temporal Logic $\mathcal{BLTL}$
inferred← citeshttps://doi.org/10.1007/978-3-642-15393-8_37openalex-snapshot
Interpretation of Chance Discovery in Temporal Logic, Admissible Inference Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-35722-0_15openalex-snapshot
A Note on Extensions: Admissible Rules via Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-46906-4_2openalex-snapshot
Tutorial on Admissible Rules in Gudauri
inferred← citeshttps://doi.org/10.1007/bf00370188openalex-snapshot
On structural completeness of implicational logics
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/s00153-011-0250-yopenalex-snapshot
A note on admissible rules and the disjunction property in intermediate logics
inferred← citeshttps://doi.org/10.1007/s00153-014-0388-5openalex-snapshot
Admissibility and refutation: some characterisations of intermediate logics
inferred← citeshttps://doi.org/10.1007/s00224-007-9059-9openalex-snapshot
Branching Time Logics $\mathcal {BTL}^{\mathrm {U,S}}_{\mathrm {N},\mathrm {N}^{-1}}(\mathcal {Z})_{\alpha }$ with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms
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.1007/s10958-006-0116-8openalex-snapshot
Intuitionistic Frege systems are polynomially equivalent
inferred← citeshttps://doi.org/10.1007/s10992-014-9322-xopenalex-snapshot
Failure of Completeness in Proof-Theoretic Semantics
inferred← citeshttps://doi.org/10.1007/s11225-016-9672-1openalex-snapshot
Finite Frames Fail: How Infinity Works Its Way into the Semantics of Admissibility
inferred← citeshttps://doi.org/10.1007/s11787-017-0180-5openalex-snapshot
Admissibility in Positive Logics
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90055-7openalex-snapshot
Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
inferred← citeshttps://doi.org/10.1016/j.apal.2008.03.001openalex-snapshot
Linear temporal logic with until and next, logical consecutions
inferred← citeshttps://doi.org/10.1016/j.apal.2010.09.001openalex-snapshot
Admissible rules in the implication–negation fragment of intuitionistic logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.04.003openalex-snapshot
A Tableau Method for Checking Rule Admissibility in S4
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2025.05.043openalex-snapshot
On the universal theory of the free pseudocomplemented distributive lattice
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.012openalex-snapshot
Rules admissible in transitive temporal logic TS4 , sufficient condition
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70041-7openalex-snapshot
Problems of Admissibility and Substitution, Logical Equations and Restricted Theories of free Algebras
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70007-xopenalex-snapshot
The Logic of Brouwer and Heyting
inferred← citeshttps://doi.org/10.1017/jsl.2015.5openalex-snapshot
UNIFICATION IN INTERMEDIATE LOGICS
inferred← citeshttps://doi.org/10.1017/s0960129500000165openalex-snapshot
Admissible and derivable rules in intuitionistic logic
inferred← citeshttps://doi.org/10.1017/s1755020319000169openalex-snapshot
HEREDITARILY STRUCTURALLY COMPLETE POSITIVE LOGICS
inferred← citeshttps://doi.org/10.1070/im1991v037n03abeh002165openalex-snapshot
CRITERIA FOR ADMISSIBILITY OF RULES OF INFERENCE WITH PARAMETERS IN THE INTUITIONISTIC PROPOSITIONAL CALCULUS
inferred← citeshttps://doi.org/10.1070/sm1977v031n02abeh002303openalex-snapshot
ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
inferred← citeshttps://doi.org/10.1093/jigpal/jzn014openalex-snapshot
Structural Completeness in Substructural Logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzt029openalex-snapshot
Constructive semantics, admissibility of rules and the validity of Peirce's law
inferred← citeshttps://doi.org/10.1093/logcom/exm078openalex-snapshot
Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification
inferred← citeshttps://doi.org/10.1093/logcom/exq020openalex-snapshot
Linear Temporal Logic LTL: Basis for Admissible Rules
inferred← citeshttps://doi.org/10.1134/s0037446624010142openalex-snapshot
Admissible Inference Rules of Modal WCP-Logics
inferred← citeshttps://doi.org/10.1215/00294527-345997openalex-snapshot
A Syntactic Approach to Unification in Transitive Reflexive Modal Logics
inferred← citeshttps://doi.org/10.1215/00294527-3659423openalex-snapshot
Algebraic Logic Perspective on Prucnal’s Substitution
inferred← citeshttps://doi.org/10.1215/00294527-3838972openalex-snapshot
The Admissible Rules of BD2 and GSc
inferred← citeshttps://doi.org/10.12775/llp.2008.003openalex-snapshot
A mind of a non-countable set of ideas
inferred← citeshttps://doi.org/10.12775/llp.2008.009openalex-snapshot
Discrete linear temporal logic with current time point clusters, deciding algorithms
inferred← citeshttps://doi.org/10.2178/jsl/1129642119openalex-snapshot
Logical consecutions in discrete linear temporal logic
inferred← citeshttps://doi.org/10.2307/2275439openalex-snapshot
Rules of inference with parameters for intuitionistic logic
inferred← citeshttps://doi.org/10.2307/2275521openalex-snapshot
Hereditarily structurally complete modal logics
inferred← citeshttps://doi.org/10.2307/2694922openalex-snapshot
On the admissible rules of intuitionistic propositional logic
inferred← citeshttps://doi.org/10.29007/1821openalex-snapshot
A System for Evaluating the Admissibility of Rules for Intuitionistic Propositional Logic
inferred← citeshttps://doi.org/10.29007/cll3openalex-snapshot
Complexity of Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic
inferred← citeshttps://doi.org/10.3166/jancl.17.383-396openalex-snapshot
Logics with the universal modality and admissible consecutions
inferred← citeshttps://doi.org/10.4000/philosophiascientiae.965openalex-snapshot
A Critical Remark on the BHK Interpretation of Implication
inferred← citeshttps://doi.org/10.48550/arxiv.1504.03380openalex-snapshot
Mathematical semantics of intuitionistic logic
inferred← citeshttps://doi.org/10.48550/arxiv.1610.08700openalex-snapshot
Admissibility in Positive Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1701.05138openalex-snapshot
Rejecting inadmissible rules in reduced normal forms in S4
inferred← citeshttps://doi.org/10.5555/1366742.1366761openalex-snapshot
Decidability w.r.t. Logical Consecutions of Linear Temporal Logic Extended by Since and Previous
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.