On the public citation graph

Modal logics with several operators and provability interpretations

0 signed · 20 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/bf02757006openalex-snapshot
Provability interpretations of modal logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)71123-6openalex-snapshot
The Incompleteness Theorems
inferredcites →https://doi.org/10.2307/2266895openalex-snapshot
Solution of a problem of Leon Henkin
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.1002/malq.19890350407openalex-snapshot
Rosser Orderings in Bimodal Logics
inferred← citeshttps://doi.org/10.1007/0-387-31072-x_2openalex-snapshot
Problems in the Logic of Provability
inferred← citeshttps://doi.org/10.1007/1-4020-3521-7_3openalex-snapshot
Provability Logic
inferred← citeshttps://doi.org/10.1007/978-0-387-69245-6_1openalex-snapshot
On Two Models of Provability
inferred← citeshttps://doi.org/10.1007/978-0-8176-4769-8_9openalex-snapshot
The Development of Self-Reference: Löb’s Theorem
inferred← citeshttps://doi.org/10.1007/bf00370390openalex-snapshot
Provability logics for natural turing progressions of arithmetical theories
inferred← citeshttps://doi.org/10.1007/bf00970985openalex-snapshot
Independent enumerations of theories and recursive progressions
inferred← citeshttps://doi.org/10.1007/bf01620761openalex-snapshot
Rosser and mostowski sentences
inferred← citeshttps://doi.org/10.1007/s11225-016-9654-3openalex-snapshot
Franco Montagna’s Work on Provability Logic and Many-valued Logic
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90071-xopenalex-snapshot
On bimodal logics of provability
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80022-0openalex-snapshot
The Logic of Provability
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80019-xopenalex-snapshot
16 Modal logic in mathematics
inferred← citeshttps://doi.org/10.1093/jigpal/jzac054openalex-snapshot
The early history of formal diagonalization
inferred← citeshttps://doi.org/10.1111/j.1755-2567.1996.tb00529.xopenalex-snapshot
Provability logic—a short introduction
inferred← citeshttps://doi.org/10.1305/ndjfl/1093637556openalex-snapshot
Quantified modal logic and self-reference.
inferred← citeshttps://doi.org/10.2307/2275600openalex-snapshot
Bimodal logics for extensions of arithmetical theories
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.