On the public citation graph
Decidable modal logic with undecidable admissibility problem
0 signed · 22 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.1016/s0049-237x(08)70041-7openalex-snapshot
Problems of Admissibility and Substitution, Logical Equations and Restricted Theories of free Algebras
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-3-319-27683-0_6openalex-snapshot
Multiple Conclusion Rules in Logics with the Disjunction Property
inferred← citeshttps://doi.org/10.1007/978-3-662-46906-4_2openalex-snapshot
Tutorial on Admissible Rules in Gudauri
inferred← citeshttps://doi.org/10.1007/978-3-662-58771-3_1openalex-snapshot
Unification in Modal Logic
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/s00153-006-0028-9openalex-snapshot
Complexity of admissible rules
inferred← citeshttps://doi.org/10.1017/s1755020316000241openalex-snapshot
PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS
inferred← citeshttps://doi.org/10.1080/01445340.2018.1439257openalex-snapshot
The Context of Inference
inferred← citeshttps://doi.org/10.1080/01445340.2021.1889117openalex-snapshot
The Deduction Theorem (Before and After Herbrand)
inferred← citeshttps://doi.org/10.1093/jigpal/jzad021openalex-snapshot
Undecidability of admissibility in the product of two Alt 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/exp078openalex-snapshot
Admissible Rules of Lukasiewicz Logic
inferred← citeshttps://doi.org/10.1093/logcom/exp082openalex-snapshot
Bases of Admissible Rules of Lukasiewicz Logic
inferred← citeshttps://doi.org/10.1145/1380572.1380574openalex-snapshot
Undecidability of the unification and admissibility problems for modal and description logics
inferred← citeshttps://doi.org/10.1215/00294527-345997openalex-snapshot
A Syntactic Approach to Unification in Transitive Reflexive Modal Logics
inferred← citeshttps://doi.org/10.1215/00294527-3671151openalex-snapshot
Admissible Rules and the Leibniz Hierarchy
inferred← citeshttps://doi.org/10.12775/llp.2008.009openalex-snapshot
Discrete linear temporal logic with current time point clusters, deciding algorithms
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.