On the public citation graph

Undecidable properties of extensions of a provability logic. II

https://doi.org/10.1007/bf02215288
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.
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.1002/malq.19800262203openalex-snapshot
Post Completeness and Free Algebras
inferredcites →https://doi.org/10.1007/bf01979939openalex-snapshot
Undecidable properties of extensions of the logic of provability
inferredcites →https://doi.org/10.1007/bf01984693openalex-snapshot
Varieties of logical matrices
inferredcites →https://doi.org/10.1111/j.1755-2567.1980.tb00686.xopenalex-snapshot
On systems of modal logic with provability interpretations

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-015-8879-9_8openalex-snapshot
Canonical Formulas for Modal and Superintuitionistic Logics: A Short Outline
inferred← citeshttps://doi.org/10.1007/978-94-017-0454-0_2openalex-snapshot
Advanced Modal Logic
inferred← citeshttps://doi.org/10.1007/bf00370182openalex-snapshot
The disjunction property of intermediate propositional logics
inferred← citeshttps://doi.org/10.1007/bf00370331openalex-snapshot
Modal companions of intermediate propositional logics
inferred← citeshttps://doi.org/10.1007/bfb0022274openalex-snapshot
Algorithmic aspects of propositional tense logics
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/s10469-015-9336-7openalex-snapshot
Recognizable Logics
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/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.1017/s1755020317000259openalex-snapshot
COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
inferred← citeshttps://doi.org/10.2307/2275108openalex-snapshot
The undecidability of the disjunction property of propositional logics and other related problems
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.