On the public citation graph

Admissible rules for logics containing S4.3

https://doi.org/10.1007/bf00968695
0 signed · 14 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.1002/malq.19710170141openalex-snapshot
The Logics Containing S 4.3
inferredcites →https://doi.org/10.1007/bf00248735openalex-snapshot
The deducibilities of S5
inferredcites →https://doi.org/10.1007/bf01668576openalex-snapshot
Pretabular extensions of LewisS4
inferredcites →https://doi.org/10.1007/bf01669113openalex-snapshot
Admissible rules for pretable modal logics

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-94-017-0454-0_2openalex-snapshot
Advanced 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/bf01978885openalex-snapshot
Equations in free topoboolean algebra
inferred← citeshttps://doi.org/10.1007/s00153-019-00682-xopenalex-snapshot
Deciding active structural completeness
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.2016.03.002openalex-snapshot
Almost structural completeness; an algebraic approach
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.1215/00294527-3636512openalex-snapshot
Modal Consequence Relations Extending S4.3: An Application of Projective Unification
inferred← citeshttps://doi.org/10.18778/0138-0680.44.1.2.01openalex-snapshot
Unifiability and Structural Completeness in Relation Algebras and in Products of Modal Logic S5
inferred← citeshttps://doi.org/10.33540/1486openalex-snapshot
Uniform Interpolation and Admissible Rules
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.