On the public citation graph

Blending margins: the modal logic K has nullary unification type

0 signed · 52 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.1006/jsco.2000.0426openalex-snapshot
Unification of Concept Terms in Description Logics
inferredcites →https://doi.org/10.1007/978-3-642-03754-2_1openalex-snapshot
Description Logics
inferredcites →https://doi.org/10.1007/bf01417959openalex-snapshot
Non-genuine MacIntosh logics
inferredcites →https://doi.org/10.1016/b978-044450813-3/50010-2openalex-snapshot
Unification Theory
inferredcites →https://doi.org/10.1016/j.apal.2012.10.001openalex-snapshot
Duality, projectivity, and unification in Łukasiewicz logic and MV-algebras
inferredcites →https://doi.org/10.1016/s0049-237x(09)70122-3openalex-snapshot
Formulas of One Propositional Variable in Intuitionistic Arithmetic
inferredcites →https://doi.org/10.1016/s0049-237x(97)x8001-2openalex-snapshot
Admissibility of Logical Inference Rules
inferredcites →https://doi.org/10.1016/s0168-0072(99)00032-9openalex-snapshot
Best solving modal equations
inferredcites →https://doi.org/10.1016/s1574-6526(07)03003-9openalex-snapshot
Chapter 3 Description Logics
inferredcites →https://doi.org/10.1016/s1574-6526(07)x0300-6openalex-snapshot
Handbook of Knowledge Representation
inferredcites →https://doi.org/10.1016/s1574-6526(12)70003-2openalex-snapshot
Foundations of Artificial Intelligence
inferredcites →https://doi.org/10.1017/cbo9781107050884openalex-snapshot
Modal Logic
inferredcites →https://doi.org/10.1093/jigpal/jzq008openalex-snapshot
Unification in modal and description logics
inferredcites →https://doi.org/10.1093/logcom/exi029openalex-snapshot
Admissible Rules of Modal Logics
inferredcites →https://doi.org/10.1093/logcom/exp082openalex-snapshot
Bases of Admissible Rules of Lukasiewicz Logic
inferredcites →https://doi.org/10.1093/oso/9780198537793.001.0001openalex-snapshot
Modal Logic
inferredcites →https://doi.org/10.1145/1380572.1380574openalex-snapshot
Undecidability of the unification and admissibility problems for modal and description logics
inferredcites →https://doi.org/10.1305/ndjfl/1093634728openalex-snapshot
Some admissible rules in nonnormal modal systems.
inferredcites →https://doi.org/10.1305/ndjfl/1093636011openalex-snapshot
An alternative rule of disjunction in modal logic.
inferredcites →https://doi.org/10.1515/forum-2011-0131openalex-snapshot
Simplicial geometry of unital lattice-ordered abelian groups
inferredcites →https://doi.org/10.2168/lmcs-6(3:17)2010openalex-snapshot
Unification in the Description Logic EL
inferredcites →https://doi.org/10.2307/2586506openalex-snapshot
Unification in intuitionistic logic
inferredcites →https://doi.org/10.2307/2694922openalex-snapshot
On the admissible rules of intuitionistic propositional 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-3-030-86205-3_5openalex-snapshot
Restricted Unification in the DL $$\mathcal {FL}_0$$
inferred← citeshttps://doi.org/10.1007/978-3-031-47921-2_7openalex-snapshot
About the Unification Types of Modal Logics
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-981-15-1342-8_4openalex-snapshot
Contact Logic is Finitary for Unification with Constants
inferred← citeshttps://doi.org/10.1007/s10472-021-09768-wopenalex-snapshot
About the unification type of $\mathbf {K}+\square \square \bot $
inferred← citeshttps://doi.org/10.1007/s11225-019-09883-0openalex-snapshot
About the Unification Type of Modal Logics Between $$\mathbf {KB}$$ and $$\mathbf {KTB}$$
inferred← citeshttps://doi.org/10.1007/s11787-021-00287-0openalex-snapshot
Unification in Pretabular Extensions of S4
inferred← citeshttps://doi.org/10.1016/j.apal.2021.103072openalex-snapshot
Finitary unification in locally tabular modal logics characterized
inferred← citeshttps://doi.org/10.1016/j.apal.2022.103233openalex-snapshot
Admissible rules for six intuitionistic modal logics
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103508openalex-snapshot
Unification types and union splittings in intermediate logics
inferred← citeshttps://doi.org/10.1080/11663081.2017.1368845openalex-snapshot
Unification in epistemic logics
inferred← citeshttps://doi.org/10.1080/11663081.2018.1428000openalex-snapshot
KD is nullary
inferred← citeshttps://doi.org/10.1093/jigpal/jzab014openalex-snapshot
Unification with parameters in the implication fragment of classical propositional logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzab033openalex-snapshot
Remarks about the unification types of some locally tabular normal modal logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzab036openalex-snapshot
Unification types in Euclidean modal logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzaf071openalex-snapshot
Unification in subsystems of polymodal provability logic GLP
inferred← citeshttps://doi.org/10.1093/jigpal/jzag010openalex-snapshot
On unification in some subintuitionistic logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzy078openalex-snapshot
Remarks about the unification type of several non-symmetric non-transitive modal logics
inferred← citeshttps://doi.org/10.1093/logcom/exab081openalex-snapshot
Projective unification in weakly transitive and weakly symmetric modal logics
inferred← citeshttps://doi.org/10.1093/logcom/exad058openalex-snapshot
Projective relative unification through duality
inferred← citeshttps://doi.org/10.1093/logcom/exae084openalex-snapshot
Computing most general unifiers in Euclidean modal logics
inferred← citeshttps://doi.org/10.17516/1997-1397-2018-11-1-3-9openalex-snapshot
Unification in Linear Modal Logic on Non-transitive Time with the Universal Modality
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:23)2015openalex-snapshot
Exact Unification and Admissibility
inferred← citeshttps://doi.org/10.25368/2022.266openalex-snapshot
Restricted Unification in the DL FL₀ (Extended Version)
inferred← citeshttps://doi.org/10.33540/1486openalex-snapshot
Uniform Interpolation and Admissible Rules
inferred← citeshttps://doi.org/10.4213/im9592openalex-snapshot
On the unification problem for $\mathrm{GLP}$
inferred← citeshttps://doi.org/10.4213/im9592eopenalex-snapshot
On the unification problem for $\mathrm{GLP}$
inferred← citeshttps://doi.org/10.48550/arxiv.2004.07904openalex-snapshot
About the unification types of the modal logics determined by classes of deterministic frames
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.