On the public citation graph

Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property

https://doi.org/10.1007/bf01054709
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/978-3-322-85796-5openalex-snapshot
Klassische und nichtklassische Aussagenlogik
inferredcites →https://doi.org/10.1007/bf00935600openalex-snapshot
Logical equations and admissible rules of inference with parameters in modal provability logics
inferredcites →https://doi.org/10.1007/bf01463150openalex-snapshot
A lattice of normal modal logics
inferredcites →https://doi.org/10.1007/bf01669113openalex-snapshot
Admissible rules for pretable modal logics
inferredcites →https://doi.org/10.1007/bf01978706openalex-snapshot
Bases of admissible rules of the logics S4 and Int
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.1016/0168-0072(90)90055-7openalex-snapshot
Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
inferredcites →https://doi.org/10.1016/s0049-237x(08)70041-7openalex-snapshot
Problems of Admissibility and Substitution, Logical Equations and Restricted Theories of free Algebras
inferredcites →https://doi.org/10.1016/s1385-7258(66)50036-1openalex-snapshot
On the connection of partially ordered sets with some pseudo-Boolean algebras
inferredcites →https://doi.org/10.1017/s0004972700041186openalex-snapshot
Metamathematics of modal logic
inferredcites →https://doi.org/10.1070/sm1987v056n02abeh003038openalex-snapshot
BASES OF ADMISSIBLE RULES OF THE MODAL SYSTEM $ \mathrm{Grz}$ AND OF INTUITIONISTIC LOGIC
inferredcites →https://doi.org/10.1090/memo/0396openalex-snapshot
Algebraizable logics
inferredcites →https://doi.org/10.2307/2272340openalex-snapshot
Logics containing K4. Part I
inferredcites →https://doi.org/10.2307/2272344openalex-snapshot
A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property
inferredcites →https://doi.org/10.2307/2273952openalex-snapshot
Finitely generated free Heyting algebras
inferredcites →https://doi.org/10.2307/2275439openalex-snapshot
Rules of inference with parameters for intuitionistic logic
inferredcites →https://doi.org/10.2307/2275447openalex-snapshot
What is an inference rule?
inferredcites →https://doi.org/10.4467/20842589rmopenalex-snapshot
Reports on 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/3-540-63045-7_34openalex-snapshot
Quasi-characteristic inference rules for modal logics
inferred← citeshttps://doi.org/10.1007/978-94-017-0454-0_2openalex-snapshot
Advanced Modal Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-2109-7_15openalex-snapshot
A First-Order Effect and Modal Propositional Formulas
inferred← citeshttps://doi.org/10.1007/bf02671605openalex-snapshot
Admissible inference rules for polymodal logicS5 n C
inferred← citeshttps://doi.org/10.1007/bf02681665openalex-snapshot
Autostability of hyperarithmetical models
inferred← citeshttps://doi.org/10.1007/bf02681666openalex-snapshot
Independent bases for admissible rules in pretable logics
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.1023/a:1005244015730openalex-snapshot
On Self-Admissible Quasi-Characterizing Inference Rules
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.1023/a:1012557903153openalex-snapshot
Residual Finiteness for Admissible Inference Rules
inferred← citeshttps://doi.org/10.1080/11663081.2000.10511004openalex-snapshot
Unification and Passive Inference Rules for Modal Logics
inferred← citeshttps://doi.org/10.1093/jigpal/10.4.401openalex-snapshot
Description of Modal Logics Inheriting Admissible Rules for K4
inferred← citeshttps://doi.org/10.2307/420957openalex-snapshot
1995–1996 Winter Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.55937/sut/1262184422openalex-snapshot
POLY−MODAL LOGIC S5nC
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.