On the public citation graph
A hierarchy of cuts in models of arithmetic
0 signed · 54 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/bfb0067653openalex-snapshot
Initial segments of models of Peano's axioms
inferredcites →https://doi.org/10.1016/s0049-237x(08)71130-3openalex-snapshot
A Mathematical Incompleteness in Peano Arithmetic
inferredcites →https://doi.org/10.1016/s0049-237x(08)72003-2openalex-snapshot
∑n-Collection Schemas in Arithmetic
inferredcites →https://doi.org/10.2307/2273511openalex-snapshot
Some independence results for Peano 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.19860320109openalex-snapshot
The Pigeonhole Principle and Fragments of Arithmetic
inferred← citeshttps://doi.org/10.1002/malq.19870330407openalex-snapshot
Reflection Principles in Fragments of Peano Arithmetic
inferred← citeshttps://doi.org/10.1002/malq.200410055openalex-snapshot
Envelopes, indicators and conservativeness
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_16openalex-snapshot
Combinatorial Statements Independent of Arithmetic
inferred← citeshttps://doi.org/10.1007/bf01269946openalex-snapshot
Connected components of graphs and reverse mathematics
inferred← citeshttps://doi.org/10.1007/bf02017489openalex-snapshot
Combinatorial principles concerning approximations of functions
inferred← citeshttps://doi.org/10.1007/bfb0076215openalex-snapshot
Applications of the low-basis theorem in arithmetic
inferred← citeshttps://doi.org/10.1007/bfb0095660openalex-snapshot
Anti-Basis theorems and their relation to independence results in Peano arithmetic
inferred← citeshttps://doi.org/10.1007/bfb0095667openalex-snapshot
Some conservation results for fragments of arithmetic
inferred← citeshttps://doi.org/10.1007/s00153-004-0218-2openalex-snapshot
A note on a theorem of Kanovei
inferred← citeshttps://doi.org/10.1007/s001530050099openalex-snapshot
A proof-theoretic analysis of collection
inferred← citeshttps://doi.org/10.1007/s10958-009-9408-0openalex-snapshot
The lengths of proofs: Kreisel’s conjecture and Gödel’s speed-up theorem
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90074-1openalex-snapshot
On Gödel incompleteness and finite combinatorics
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90012-2openalex-snapshot
On the number of steps in proofs
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90035-zopenalex-snapshot
Inductive full satisfaction classes
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90031-8openalex-snapshot
Subsystems of true arithmetic and hierarchies of functions
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90148-7openalex-snapshot
Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90197-lopenalex-snapshot
A sharpened version of McAloon's theorem on initial segments of models of IΔ0
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00029-gopenalex-snapshot
Transfinite induction within Peano arithmetic
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90169-6openalex-snapshot
On the finite containment problem for Petri nets
inferred← citeshttps://doi.org/10.1016/j.apal.2017.01.004openalex-snapshot
Proof lengths for instances of the Paris–Harrington principle
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80018-9openalex-snapshot
Hierarchies of Provably Recursive Functions
inferred← citeshttps://doi.org/10.1017/s0022481200027948openalex-snapshot
On parameter free induction schemas
inferred← citeshttps://doi.org/10.1090/proc12759openalex-snapshot
Independence of Ramsey theorem variants using $\varepsilon _0$
inferred← citeshttps://doi.org/10.1090/s0002-9939-1983-0715859-8openalex-snapshot
Reducibilities Among Decision Problems for HNN Groups, Vector Addition Systems and Subsystems of Peano Arithmetic
inferred← citeshttps://doi.org/10.1109/lics.1992.185542openalex-snapshot
Cutting planes and constant depth Frege proofs
inferred← citeshttps://doi.org/10.1112/blms/14.4.285openalex-snapshot
Accessible Independence Results for Peano Arithmetic
inferred← citeshttps://doi.org/10.1142/9789811245220_0011openalex-snapshot
More or Less Uniform Convergence
inferred← citeshttps://doi.org/10.1184/r1/6492338openalex-snapshot
Notes on II-conservativity, w-submodels, and the Collection Schema
inferred← citeshttps://doi.org/10.1184/r1/6492341openalex-snapshot
Notes on Pi^1_1 Conservativity, Omega-Submodels, and the Collection Schema
inferred← citeshttps://doi.org/10.2178/jsl/1045861504openalex-snapshot
On the induction schema for decidable predicates
inferred← citeshttps://doi.org/10.2178/jsl/1174668391openalex-snapshot
Combinatorial principles weaker than Ramsey's Theorem for pairs
inferred← citeshttps://doi.org/10.2178/jsl/1183743742openalex-snapshot
Model-Theoretic Properties Characterizing Peano Arithmetic
inferred← citeshttps://doi.org/10.2307/2273672openalex-snapshot
Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic
inferred← citeshttps://doi.org/10.2307/2274131openalex-snapshot
Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
inferred← citeshttps://doi.org/10.2307/2694910openalex-snapshot
On the strength of Ramsey's theorem for pairs
inferred← citeshttps://doi.org/10.2307/421195openalex-snapshot
A Model-Theoretic Approach to Ordinal Analysis
inferred← citeshttps://doi.org/10.2969/jmsj/03840721openalex-snapshot
Provably recursive functions in fragments of Peano arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.1602.01822openalex-snapshot
Slow and Ordinary Provability for Peano Arithmetic
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.