On the public citation graph
The strength of sharply bounded induction
0 signed · 31 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.1002/malq.19980440207openalex-snapshot
A Model‐Theoretic Property of Sharply Bounded Formulae, with some Applications
inferredcites →https://doi.org/10.1007/bf01352935openalex-snapshot
A note on sharply bounded arithmetic
inferredcites →https://doi.org/10.1007/bfb0022571openalex-snapshot
On the weakness of sharply bounded polynomial induction
inferredcites →https://doi.org/10.1016/0168-0072(91)90043-lopenalex-snapshot
Bounded arithmetic and the polynomial hierarchy
inferredcites →https://doi.org/10.1016/0168-0072(94)00057-aopenalex-snapshot
Relating the bounded arithmetic and polynomial time hierarchies
inferredcites →https://doi.org/10.1016/s0049-237x(98)80017-7openalex-snapshot
First-Order Proof Theory of Arithmetic
inferredcites →https://doi.org/10.1017/cbo9780511529948openalex-snapshot
Bounded Arithmetic, Propositional Logic and Complexity Theory
inferredcites →https://doi.org/10.1090/conm/106/1057828openalex-snapshot
Sharply bounded arithmetic and the function 𝑎\stackrel{.}-1
inferredcites →https://doi.org/10.1090/dimacs/039/05openalex-snapshot
Relating the provable collapse of 𝐏 to 𝐍𝐂¹ and the power of logical theories
inferredcites →https://doi.org/10.1145/800116.803756openalex-snapshot
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
inferredcites →https://doi.org/10.2307/2270886openalex-snapshot
Alan Cobham. The intrinsic computational difficulty of functions. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress, edited by Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, 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.200910009openalex-snapshot
Abelian groups and quadratic residues in weak arithmetic
inferred← citeshttps://doi.org/10.1002/malq.201500092openalex-snapshot
On the finite axiomatizability of
inferred← citeshttps://doi.org/10.1007/s00153-010-0220-9openalex-snapshot
Conservative fragments of $${{S}^{1}_{2}}$$ and $${{R}^{1}_{2}}$$
inferred← citeshttps://doi.org/10.1007/s00153-014-0414-7openalex-snapshot
Open induction in a bounded arithmetic for TC0
inferred← citeshttps://doi.org/10.1016/j.apal.2009.03.002openalex-snapshot
The strength of sharply bounded induction requires MSP
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.003openalex-snapshot
Independence results for variants of sharply bounded induction
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.014openalex-snapshot
Alternating minima and maxima, Nash equilibria and Bounded Arithmetic
inferred← citeshttps://doi.org/10.1017/jsl.2013.37openalex-snapshot
FRAGMENTS OF APPROXIMATE COUNTING
inferred← citeshttps://doi.org/10.1017/jsl.2015.53openalex-snapshot
END-EXTENSIONS OF MODELS OF WEAK ARITHMETIC FROM COMPLEXITY-THEORETIC CONTAINMENTS
inferred← citeshttps://doi.org/10.1090/s0002-9947-2015-06233-3openalex-snapshot
Collapsing modular counting in bounded arithmetic and constant depth propositional proofs
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00040openalex-snapshot
Reverse Mathematics of Complexity Lower Bounds
inferred← citeshttps://doi.org/10.1112/plms/pdq044openalex-snapshot
The provably total search problems of bounded arithmetic
inferred← citeshttps://doi.org/10.1145/2629555openalex-snapshot
The Ordering Principle in a Fragment of Approximate Counting
inferred← citeshttps://doi.org/10.1145/3060145openalex-snapshot
The NP Search Problems of Frege and Extended Frege Proofs
inferred← citeshttps://doi.org/10.1145/3798129.3800842openalex-snapshot
A Theory for Probabilistic Polynomial-Time Reasoning
inferred← citeshttps://doi.org/10.2178/jsl/1191333850openalex-snapshot
Approximate counting in bounded arithmetic
inferred← citeshttps://doi.org/10.2178/jsl/1245158087openalex-snapshot
Approximate counting by hashing in bounded arithmetic
inferred← citeshttps://doi.org/10.23638/lmcs-16(2:12)2020openalex-snapshot
Consistency of circuit lower bounds with bounded theories
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.