On the public citation graph

Provability logics for natural turing progressions of arithmetical theories

https://doi.org/10.1007/bf00370390
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/bf01703328openalex-snapshot
Jahresbericht der deutschen Mathematiker-Vereinigung
inferredcites →https://doi.org/10.1007/bf02757006openalex-snapshot
Provability interpretations of modal logic
inferredcites →https://doi.org/10.1007/bf02764872openalex-snapshot
Modal logics with several operators and provability interpretations
inferredcites →https://doi.org/10.1016/0168-0072(93)e0079-4openalex-snapshot
A course on bimodal provability logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)71633-1openalex-snapshot
A Fine Structure Generated by Reflection Formulas over Primitive Recursive Arithmetic
inferredcites →https://doi.org/10.1305/ndjfl/1093637556openalex-snapshot
Quantified modal logic and self-reference.
inferredcites →https://doi.org/10.2307/2274396openalex-snapshot
Provability in finite subtheories of PA and relative interpretability: a modal investigation
inferredcites →https://doi.org/10.2307/2964649openalex-snapshot
Transfinite recursive progressions of axiomatic theories

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/1-4020-3521-7_3openalex-snapshot
Provability 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/bf00970985openalex-snapshot
Independent enumerations of theories and recursive progressions
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90071-xopenalex-snapshot
On bimodal logics of provability
inferred← citeshttps://doi.org/10.1016/j.apal.2017.12.006openalex-snapshot
The omega-rule interpretation of transfinite provability logic
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80022-0openalex-snapshot
The Logic of Provability
inferred← citeshttps://doi.org/10.1017/jsl.2018.65openalex-snapshot
ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR
inferred← citeshttps://doi.org/10.1111/j.1755-2567.1996.tb00529.xopenalex-snapshot
Provability logic—a short introduction
inferred← citeshttps://doi.org/10.1215/00294527-2019-0037openalex-snapshot
The Logic of Turing Progressions
inferred← citeshttps://doi.org/10.2307/2275600openalex-snapshot
Bimodal logics for extensions of arithmetical theories
inferred← citeshttps://doi.org/10.3233/com-220400openalex-snapshot
Evitable iterates of the consistency operator
inferred← citeshttps://doi.org/10.48550/arxiv.1804.10452openalex-snapshot
A Finitely Supported Frame for the Turing Schmerl Calculus
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.