On the public citation graph
The formalization of Interpretability
0 signed · 78 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.1007/10992.1573-0433openalex-snapshot
Journal of Philosophical Logic
inferredcites →https://doi.org/10.1007/978-1-4613-8601-8openalex-snapshot
Self-Reference and Modal Logic
inferredcites →https://doi.org/10.1007/bf00297579openalex-snapshot
The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic
inferredcites →https://doi.org/10.1007/bf00370384openalex-snapshot
A note on the normal form of closed formulas of interpretability logic
inferredcites →https://doi.org/10.1007/bf00370385openalex-snapshot
Some independence results in interpretability logic
inferredcites →https://doi.org/10.1007/bf00370386openalex-snapshot
Explicit Fixed Points in Interpretability Logic
inferredcites →https://doi.org/10.1007/bf01624079openalex-snapshot
Arithmetic analogues of McAloon's unique Rosser sentences
inferredcites →https://doi.org/10.1007/bf03024028openalex-snapshot
The War of the frogs and the mice, or the crisis of themathematische annalen
inferredcites →https://doi.org/10.1016/0004-3702(91)90060-wopenalex-snapshot
On the justification of Dempster's rule of combination
inferredcites →https://doi.org/10.1016/0168-0072(87)90066-2openalex-snapshot
On the scheme of induction for bounded arithmetic formulas
inferredcites →https://doi.org/10.1016/0168-0072(88)90046-2openalex-snapshot
Bounded arithmetic and truth definition
inferredcites →https://doi.org/10.1016/s0020-7373(89)80032-xopenalex-snapshot
A computationally efficient approximation of Dempster-Shafer theory
inferredcites →https://doi.org/10.1016/s0049-237x(08)71626-4openalex-snapshot
On Partially Conservative Extensions of Arithmetic
inferredcites →https://doi.org/10.1016/s0049-237x(09)70160-0openalex-snapshot
Nonstandard Models and Related Developments
inferredcites →https://doi.org/10.1017/cbo9780511608841.012openalex-snapshot
A modular approach to protocol verification using process algebra
inferredcites →https://doi.org/10.1070/im1986v027n03abeh001183openalex-snapshot
ON MODAL LOGICS AXIOMATIZING PROVABILITY
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.1090/s0002-9947-1983-0712260-2openalex-snapshot
Some Prime Elements in the Lattice of Interpretability Types
inferredcites →https://doi.org/10.1305/ndjfl/1093635077openalex-snapshot
Peano's smart children: a provability logical study of systems with built-in consistency.
inferredcites →https://doi.org/10.1305/ndjfl/1093635332openalex-snapshot
A simplification of the completeness proofs for Guaspari and Solovay's ${\rm R}$.
inferredcites →https://doi.org/10.1305/ndjfl/1093870573openalex-snapshot
On certain lattices of degrees of interpretability.
inferredcites →https://doi.org/10.2307/2269958openalex-snapshot
Existence and feasibility in arithmetic
inferredcites →https://doi.org/10.2307/2273663openalex-snapshot
Modal analysis of generalized rosser sentences
inferredcites →https://doi.org/10.2307/2274231openalex-snapshot
Cuts, consistency statements and interpretations
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.2307/2274474openalex-snapshot
The interpretability logic of Peano arithmetic
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.202200015openalex-snapshot
Theory and application of labelling techniques for interpretability 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/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-3-031-99536-1_12openalex-snapshot
On Tame Semantics for Interpretability Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-31644-4_14openalex-snapshot
More on Systems of Truth and Predicative Comprehension
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_5openalex-snapshot
The Interpretation Existence Lemma
inferred← citeshttps://doi.org/10.1007/bf01050635openalex-snapshot
A modal perspective on the computational complexity of attribute value grammar
inferred← citeshttps://doi.org/10.1007/s001530050099openalex-snapshot
A proof-theoretic analysis of collection
inferred← citeshttps://doi.org/10.1007/s10992-015-9366-6openalex-snapshot
A Note on Typed Truth and Consistency Assertions
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90071-xopenalex-snapshot
On bimodal logics of provability
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00007-4openalex-snapshot
Iterated local reflection versus iterated consistency
inferred← citeshttps://doi.org/10.1016/j.apal.2009.02.001openalex-snapshot
The predicative Frege hierarchy
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80022-0openalex-snapshot
The Logic of Provability
inferred← citeshttps://doi.org/10.1017/9781316755747.019openalex-snapshot
Categories of theories and interpretations
inferred← citeshttps://doi.org/10.1017/9781316755860.014openalex-snapshot
“Natural” representations and extensions of Gödel's second theorem 350
inferred← citeshttps://doi.org/10.1017/jsl.2019.90openalex-snapshot
TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES
inferred← citeshttps://doi.org/10.1017/s1079898600010660openalex-snapshot
Interpretability in Robinson's Q
inferred← citeshttps://doi.org/10.1017/s1755020314000549openalex-snapshot
CONSISTENCY AND THE THEORY OF TRUTH
inferred← citeshttps://doi.org/10.1017/s1755020316000435openalex-snapshot
EQUIVALENCES FOR TRUTH PREDICATES
inferred← citeshttps://doi.org/10.1023/a:1005657917054openalex-snapshot
The Interpretability Logic of all Reasonable Arithmetical Theories
inferred← citeshttps://doi.org/10.1093/jigpal/jzn013openalex-snapshot
Modal Matters for Interpretability Logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzp082openalex-snapshot
A new principle in the interpretability logic of all reasonable arithmetical theories
inferred← citeshttps://doi.org/10.1093/logcom/exad025openalex-snapshot
Implicit commitment in a general setting
inferred← citeshttps://doi.org/10.1093/philmat/nkt042openalex-snapshot
Finitistic Arithmetic and Classical Logic
inferred← citeshttps://doi.org/10.1111/theo.70041openalex-snapshot
Kripke's Reduction of Löb's Theorem to the Second Incompleteness Theorem
inferred← citeshttps://doi.org/10.1305/ndjfl/1038949538openalex-snapshot
The Principles of Interpretability
inferred← citeshttps://doi.org/10.1305/ndjfl/1117755145openalex-snapshot
The Closed Fragment of the Interpretability Logic of PRA with a Constant for $\mathrm{I}\Sigma_1$
inferred← citeshttps://doi.org/10.17223/15617793/434/10openalex-snapshot
TYPELESS THEORIES OF TRUTH AND THE BUILT-IN PROVABILITY OF CONSISTENCY: PARALLELS AND INTERTWINING
inferred← citeshttps://doi.org/10.2307/2275181openalex-snapshot
An inside view of EXP; or, The closed fragment of the provability logic of IΔ0 + Ω1 with a prepositional constant for EXP
inferred← citeshttps://doi.org/10.2307/2275908openalex-snapshot
A small reflection principle for bounded arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.1503.09130openalex-snapshot
Two series of formalized interpretability principles for weak systems of arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.1602.00555openalex-snapshot
Characterizations of interpretability in bounded arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.1604.06946openalex-snapshot
A simple model of scientific progress - with examples
inferred← citeshttps://doi.org/10.48550/arxiv.2004.06902openalex-snapshot
A new principle in the interpretability logic of all reasonable arithmetical theories
inferred← citeshttps://doi.org/10.48550/arxiv.2004.06966openalex-snapshot
Modal Matters in Interpretability Logics
inferred← citeshttps://doi.org/10.48550/arxiv.2004.12685openalex-snapshot
The interpretability logic of all reasonable arithmetical theories
inferred← citeshttps://doi.org/10.48550/arxiv.2007.04722openalex-snapshot
An overview of Generalised Veltman Semantics
inferred← citeshttps://doi.org/10.7551/mitpress/4286.003.0014openalex-snapshot
Actions under Presuppositions
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.