On the public citation graph

Admissible rules for pretable modal logics

https://doi.org/10.1007/bf01669113
0 signed · 21 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-1-4899-5327-8_19openalex-snapshot
Admissible and Derived Rules
inferredcites →https://doi.org/10.1007/bf01463150openalex-snapshot
A lattice of normal modal logics
inferredcites →https://doi.org/10.1007/bf01668576openalex-snapshot
Pretabular extensions of LewisS4
inferredcites →https://doi.org/10.1007/bf02330744openalex-snapshot
Pretabular superintuitionist logic
inferredcites →https://doi.org/10.1070/sm1977v031n02abeh002303openalex-snapshot
ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
inferredcites →https://doi.org/10.1111/j.1755-2567.1974.tb00081.xopenalex-snapshot
An ascending chain of S4 logics
inferredcites →https://doi.org/10.1305/ndjfl/1093888226openalex-snapshot
Free ${\rm S}5$ algebras.
inferredcites →https://doi.org/10.2307/2266683openalex-snapshot
Extensions of the Lewis system S5
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/bf00935600openalex-snapshot
Logical equations and admissible rules of inference with parameters in modal provability logics
inferred← citeshttps://doi.org/10.1007/bf00968695openalex-snapshot
Admissible rules for logics containing S4.3
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/bf01978706openalex-snapshot
Bases of admissible rules of the logics S4 and Int
inferred← citeshttps://doi.org/10.1007/bf01978885openalex-snapshot
Equations in free topoboolean algebra
inferred← citeshttps://doi.org/10.1007/bf01979701openalex-snapshot
Decidability of the admissibility problem in layer-finite 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/bf02259929openalex-snapshot
The decidability of admissibility problems for modal logics S4.2 and S4.2Grz and superintuitionistic logic KC
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.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/s0049-237x(08)70041-7openalex-snapshot
Problems of Admissibility and Substitution, Logical Equations and Restricted Theories of free Algebras
inferred← citeshttps://doi.org/10.1093/jigpal/jzr028openalex-snapshot
Projective unification in modal logic
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.