On the public citation graph
The unprovability of small inconsistency
0 signed · 44 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/978-1-4613-8601-8openalex-snapshot
Self-Reference and Modal Logic
inferredcites →https://doi.org/10.1007/bfb0062837openalex-snapshot
The Computational Complexity of Logical Theories
inferredcites →https://doi.org/10.1007/bfb0062844openalex-snapshot
A technique for writing short formulas defining complicated properties
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.1090/s0002-9947-1983-0712260-2openalex-snapshot
Some Prime Elements in the Lattice of Interpretability Types
inferredcites →https://doi.org/10.2307/2269958openalex-snapshot
Existence and feasibility in arithmetic
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.
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.201200102openalex-snapshot
Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories
inferred← citeshttps://doi.org/10.1002/malq.201800088openalex-snapshot
The small‐is‐very‐small principle
inferred← citeshttps://doi.org/10.1007/11554554_22openalex-snapshot
On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_5openalex-snapshot
The Interpretation Existence Lemma
inferred← citeshttps://doi.org/10.1007/978-3-7091-9461-4_5openalex-snapshot
On the lengths of proofs of consistency
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/s00153-006-0328-0openalex-snapshot
No Escape from Vardanyan's theorem
inferred← citeshttps://doi.org/10.1007/s00153-008-0087-1openalex-snapshot
Pairs, sets and sequences in first-order theories
inferred← citeshttps://doi.org/10.1007/s00153-013-0353-8openalex-snapshot
Interpretability degrees of finitely axiomatized sequential theories
inferred← citeshttps://doi.org/10.1007/s001530050099openalex-snapshot
A proof-theoretic analysis of collection
inferred← citeshttps://doi.org/10.1016/j.apal.2005.12.010openalex-snapshot
A generalization of the Second Incompleteness Theorem and some exceptions to it
inferred← citeshttps://doi.org/10.1016/j.apal.2007.01.003openalex-snapshot
Passive induction and a solution to a Paris–Wilkie open question
inferred← citeshttps://doi.org/10.1016/j.apal.2007.08.001openalex-snapshot
Sufficient conditions for cut elimination with complexity analysis
inferred← citeshttps://doi.org/10.1016/j.apal.2015.11.002openalex-snapshot
Transductions in arithmetic
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.047openalex-snapshot
The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem
inferred← citeshttps://doi.org/10.1016/j.ic.2008.11.007openalex-snapshot
Some specially formulated axiomizations for I Σ0 manage to evade the Herbrandized version of the Second Incompleteness Theorem
inferred← citeshttps://doi.org/10.1017/s1079898600010660openalex-snapshot
Interpretability in Robinson's Q
inferred← citeshttps://doi.org/10.1017/s1755020325100920openalex-snapshot
WHEN BI-INTERPRETABILITY IMPLIES SYNONYMY
inferred← citeshttps://doi.org/10.1090/proc/16975openalex-snapshot
Incompleteness of boundedly axiomatizable theories
inferred← citeshttps://doi.org/10.1093/logcom/exp048openalex-snapshot
Can We Make the Second Incompleteness Theorem Coordinate Free?
inferred← citeshttps://doi.org/10.1093/philmat/nkt042openalex-snapshot
Finitistic Arithmetic and Classical Logic
inferred← citeshttps://doi.org/10.1215/00294527-2008-028openalex-snapshot
Growing Commas. A Study of Sequentiality and Concatenation
inferred← citeshttps://doi.org/10.1305/ndjfl/1117755147openalex-snapshot
The Role of Quantifier Alternations in Cut Elimination
inferred← citeshttps://doi.org/10.2178/jsl/1129642122openalex-snapshot
An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency
inferred← citeshttps://doi.org/10.48550/arxiv.1108.6330openalex-snapshot
A Detailed Examination of Methods for Unifying, Simplifying and Extending Several Results About Self-Justifying Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1602.00555openalex-snapshot
Characterizations of interpretability in bounded arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.1602.05728openalex-snapshot
Some abstract versions of Gödel's second incompleteness theorem based on non-classical logics
inferred← citeshttps://doi.org/10.48550/arxiv.2111.14413openalex-snapshot
Friedman-reflexivity: interpreters as consistoids
inferred← citeshttps://doi.org/10.7146/brics.v10i46.21818openalex-snapshot
The Role of Quantifier Alternations in Cut Elimination
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.