On the public citation graph

Logical equations and admissible rules of inference with parameters in modal provability logics

https://doi.org/10.1007/bf00935600
0 signed · 28 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-4613-8601-8_2openalex-snapshot
Provability as Modality
inferredcites →https://doi.org/10.1007/bf00968695openalex-snapshot
Admissible rules for logics containing S4.3
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/bf01978885openalex-snapshot
Equations in free topoboolean algebra
inferredcites →https://doi.org/10.1007/bf02757006openalex-snapshot
Provability interpretations of modal logic
inferredcites →https://doi.org/10.1016/s1385-7258(58)50024-9openalex-snapshot
Remarks on sentential logics
inferredcites →https://doi.org/10.1017/cbo9780511625183openalex-snapshot
The Logic of Provability
inferredcites →https://doi.org/10.1070/im1986v027n03abeh001183openalex-snapshot
ON MODAL LOGICS AXIOMATIZING PROVABILITY
inferredcites →https://doi.org/10.1070/im1987v028n03abeh000902openalex-snapshot
DECIDABILITY OF ADMISSIBILITY IN THE MODAL SYSTEM Grz AND IN INTUITIONISTIC 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.1111/j.1755-2567.1978.tb00831.xopenalex-snapshot
Arithmetical necessity, provability and intuitionistic logic
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/978-94-017-0487-8_26openalex-snapshot
Mathematical Logic in the Former Soviet Union: Brief History and Current Trends
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/bf02681666openalex-snapshot
Independent bases for admissible rules in pretable logics
inferred← citeshttps://doi.org/10.1007/s11202-007-0033-1openalex-snapshot
An admissibility criterion for inference rules with metavariables in the modal logic S4.α N
inferred← citeshttps://doi.org/10.1007/s11225-011-9354-yopenalex-snapshot
Best Unifiers in Transitive Modal Logics
inferred← citeshttps://doi.org/10.1016/j.apal.2015.04.004openalex-snapshot
Rules with parameters in modal logic I
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.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:1010226820231openalex-snapshot
Describing a Basis in Semireduced Form for Inference Rules of Intuitionistic Logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzs015openalex-snapshot
Writing out unifiers for formulas with coefficients in intuitionistic logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzs038openalex-snapshot
Unifiers in transitive modal logics for formulas with coefficients (meta-variables)
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.17516/1997-1397-2021-14-5-667-671openalex-snapshot
Satisfiability in Boolean Logic (SAT problem) is polynomial?
inferred← citeshttps://doi.org/10.2307/2275447openalex-snapshot
What is an inference rule?
inferred← citeshttps://doi.org/10.3390/axioms8030100openalex-snapshot
Deductive Systems with Multiple-Conclusion Rules and the Disjunction Property
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.