On the public citation graph
Undecidable properties of extensions of the logic of provability
0 signed · 19 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.1002/malq.19800262203openalex-snapshot
Post Completeness and Free Algebras
inferredcites →https://doi.org/10.1007/bf01670006openalex-snapshot
Craig's theorem in superintuitionistic logics and amalgamable varieties of pseudo-boolean algebras
inferredcites →https://doi.org/10.1007/bf01673502openalex-snapshot
Interpolation theorems in modal logics and amalgamable varieties of topological Boolean algebras
inferredcites →https://doi.org/10.1111/j.1755-2567.1977.tb00788.xopenalex-snapshot
A finitely axiomatizable undecidable extension of K
inferredcites →https://doi.org/10.2307/1970290openalex-snapshot
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
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-69917-2_9openalex-snapshot
Decidability of Some Interpolation Properties for Weakly Transitive Modal Logics
inferred← citeshttps://doi.org/10.1007/bf00370182openalex-snapshot
The disjunction property of intermediate propositional logics
inferred← citeshttps://doi.org/10.1007/bf02215288openalex-snapshot
Undecidable properties of extensions of a provability logic. II
inferred← citeshttps://doi.org/10.1007/s10469-008-9035-8openalex-snapshot
Weak interpolation in extensions of the logics S 4 and K 4
inferred← citeshttps://doi.org/10.1007/s10469-009-9070-0openalex-snapshot
Decidability of the interpolation problem and of related properties in tabular logics
inferred← citeshttps://doi.org/10.1007/s10469-013-9244-7openalex-snapshot
Restricted interpolation over modal logic S4
inferred← citeshttps://doi.org/10.1007/s11202-007-0036-yopenalex-snapshot
An explicit basis for the admissible inference rules in the Gödel-Löb logic GL
inferred← citeshttps://doi.org/10.1007/s11202-010-0045-0openalex-snapshot
Interpolation properties in the extensions of the logic of inequality
inferred← citeshttps://doi.org/10.1007/s11225-006-7203-1openalex-snapshot
Definability and Interpolation in Non-Classical Logics
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80010-3openalex-snapshot
7 Modal decision problems
inferred← citeshttps://doi.org/10.1017/jsl.2026.10187openalex-snapshot
DECIDABILITY OF BEING A UNION-SPLITTING
inferred← citeshttps://doi.org/10.1145/1380572.1380574openalex-snapshot
Undecidability of the unification and admissibility problems for modal and description logics
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.