On the public citation graph

Provability in finite subtheories of PA and relative interpretability: a modal investigation

https://doi.org/10.2307/2274396
0 signed · 36 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.19610070710openalex-snapshot
Relative Interpretations
inferredcites →https://doi.org/10.1007/978-1-4613-8601-8openalex-snapshot
Self-Reference and Modal Logic
inferredcites →https://doi.org/10.1007/bf00249262openalex-snapshot
The modal logic of provability: Cut-elimination
inferredcites →https://doi.org/10.1007/bf00284977openalex-snapshot
Relatively precomplete numerations and arithmetic
inferredcites →https://doi.org/10.1007/bf00293433openalex-snapshot
The modal logic of provability. The sequential approach
inferredcites →https://doi.org/10.1007/bf02757006openalex-snapshot
Provability interpretations of modal logic
inferredcites →https://doi.org/10.1016/0003-4843(79)90017-2openalex-snapshot
Rosser sentences
inferredcites →https://doi.org/10.1016/s0049-237x(08)71123-6openalex-snapshot
The Incompleteness Theorems
inferredcites →https://doi.org/10.1090/s0002-9939-1984-0744645-9openalex-snapshot
On Partially Conservative Sentences and Interpretability
inferredcites →https://doi.org/10.1090/s0002-9947-1979-0539907-7openalex-snapshot
Partially Conservative Extensions of Arithmetic
inferredcites →https://doi.org/10.2307/2273393openalex-snapshot
Extremely undecidable sentences
inferredcites →https://doi.org/10.2307/2273625openalex-snapshot
Calculating self-referential statements: Guaspari sentences of the first kind
inferredcites →https://doi.org/10.2307/2273663openalex-snapshot
Modal analysis of generalized rosser sentences
inferredcites →https://doi.org/10.2307/2274450openalex-snapshot
C. Smoryński. Self-reference and modal logic. Universitext. Springer-Verlag, New York, Berlin, etc., 1985, xii + 333 pp.
inferredcites →https://doi.org/10.4064/fm-49-1-35-92openalex-snapshot
Arithmetization of metamathematics in a general setting
inferredcites →https://doi.org/10.4064/fm-76-2-131-137openalex-snapshot
On interpretability in theories containing arithmetic

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.1002/malq.19900360107openalex-snapshot
Much shorter proofs: A bimodal investigation
inferred← citeshttps://doi.org/10.1007/1-4020-3521-7_3openalex-snapshot
Provability Logic
inferred← citeshttps://doi.org/10.1007/978-1-4613-0609-2_13openalex-snapshot
Interpretability Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-47921-2_5openalex-snapshot
An Overview of Verbrugge Semantics, a.k.a. Generalised Veltman Semantics
inferred← citeshttps://doi.org/10.1007/978-94-017-0454-0_2openalex-snapshot
Advanced Modal Logic
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/s001530050090openalex-snapshot
All finitely axiomatizable subframe logics containing the provability logic CSM $_{0}$ are decidable
inferred← citeshttps://doi.org/10.1007/s00500-016-2449-7openalex-snapshot
Franco Montagna (1948–2015)
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(93)e0079-4openalex-snapshot
A course on bimodal provability 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)80010-3openalex-snapshot
7 Modal decision problems
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635077openalex-snapshot
Peano's smart children: a provability logical study of systems with built-in consistency.
inferred← citeshttps://doi.org/10.1305/ndjfl/1094061859openalex-snapshot
A smart child of Peano's.
inferred← citeshttps://doi.org/10.36253/979-12-215-0778-2.08openalex-snapshot
First and second Gödel’s theorems and related results
inferred← citeshttps://doi.org/10.36253/979-12-215-0778-2.09openalex-snapshot
Second incompleteness theorem: research developments and consequences
inferred← citeshttps://doi.org/10.48550/arxiv.2007.04722openalex-snapshot
An overview of Generalised Veltman Semantics
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.