On the public citation graph
Bases of admissible rules of the logics S4 and Int
0 signed · 47 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.19590051405openalex-snapshot
Modal Logics Between S 4 and S 5
inferredcites →https://doi.org/10.1007/bf01669113openalex-snapshot
Admissible rules for pretable modal logics
inferredcites →https://doi.org/10.1007/bf01979701openalex-snapshot
Decidability of the admissibility problem in layer-finite logics
inferredcites →https://doi.org/10.1007/bf01982031openalex-snapshot
A criterion for admissibility of rules in the model system S4 and the intuitionistic logic
inferredcites →https://doi.org/10.1007/bf02945004openalex-snapshot
Completeness of calculii for axiomatically defined classes of algebras
inferredcites →https://doi.org/10.2307/2271891openalex-snapshot
One hundred and two problems in mathematical logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/978-3-031-06843-0_4openalex-snapshot
Jankov Formulas and Axiomatization Techniques for Intermediate Logics
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-662-58771-3_1openalex-snapshot
Unification in Modal Logic
inferred← citeshttps://doi.org/10.1007/bf00935600openalex-snapshot
Logical equations and admissible rules of inference with parameters in modal provability logics
inferred← citeshttps://doi.org/10.1007/bf00972777openalex-snapshot
Solvability of logical equations in the modal system Grz and intuitionistic logic
inferred← citeshttps://doi.org/10.1007/bf01054709openalex-snapshot
Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
inferred← citeshttps://doi.org/10.1007/bf02260875openalex-snapshot
Bases of admissible rules in modal logics S4.2 and S4.2Grz
inferred← citeshttps://doi.org/10.1007/bf02681666openalex-snapshot
Independent bases for admissible rules in pretable 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-005-0024-xopenalex-snapshot
Decidability of the Admissibility Problem for Inference Rules in Some S5t-Logics
inferred← citeshttps://doi.org/10.1007/s10469-009-9041-5openalex-snapshot
An explicit basis for admissible inference rules in table modal logics of width 2
inferred← citeshttps://doi.org/10.1007/s10469-009-9055-zopenalex-snapshot
Table admissible inference rules
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/s11202-007-0036-yopenalex-snapshot
An explicit basis for the admissible inference rules in the Gödel-Löb logic GL
inferred← citeshttps://doi.org/10.1007/s11225-015-9642-zopenalex-snapshot
Admissible Bases Via Stable Canonical Rules
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.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.1017/bsl.2020.43openalex-snapshot
DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
inferred← citeshttps://doi.org/10.1017/s0960129500000165openalex-snapshot
Admissible and derivable rules in intuitionistic logic
inferred← citeshttps://doi.org/10.1023/a:1010226820231openalex-snapshot
Describing a Basis in Semireduced Form for Inference Rules of Intuitionistic Logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzq008openalex-snapshot
Unification in modal and description logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzy078openalex-snapshot
Remarks about the unification type of several non-symmetric non-transitive modal logics
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/s003744661503009xopenalex-snapshot
Admissible inference rules in the linear logic of knowledge and time LTK r with intransitive time relation
inferred← citeshttps://doi.org/10.1134/s0037446624010142openalex-snapshot
Admissible Inference Rules of Modal WCP-Logics
inferred← citeshttps://doi.org/10.1215/00294527-2010-031openalex-snapshot
Metalogic of Intuitionistic Propositional Calculus
inferred← citeshttps://doi.org/10.1215/00294527-3659423openalex-snapshot
Algebraic Logic Perspective on Prucnal’s Substitution
inferred← citeshttps://doi.org/10.2178/jsl/1129642119openalex-snapshot
Logical consecutions in discrete linear temporal 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.33540/1486openalex-snapshot
Uniform Interpolation and Admissible Rules
inferred← citeshttps://doi.org/10.3390/axioms8030100openalex-snapshot
Deductive Systems with Multiple-Conclusion Rules and the Disjunction Property
inferred← citeshttps://doi.org/10.48550/arxiv.1610.08700openalex-snapshot
Admissibility in Positive Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1902.03770openalex-snapshot
About the unification type of simple symmetric modal logics
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.