On the public citation graph

Applications of complexity theory to Σo-definability Problems in arithmetic

https://doi.org/10.1007/bfb0090174
0 signed · 18 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.1007/bf01070498openalex-snapshot
Rudimentary interpretation of two-tape turing computation
inferredcites →https://doi.org/10.1007/bfb0090168openalex-snapshot
Computational complexity of decision problems in elementary number theory
inferredcites →https://doi.org/10.1515/9781400882007openalex-snapshot
Theory of Formal Systems. (AM-47)
inferredcites →https://doi.org/10.2307/2269958openalex-snapshot
Existence and feasibility in 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.19890350511openalex-snapshot
Parameter‐Free Universal Induction
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_73openalex-snapshot
A survey of some recent results on computational complexity in weak theories of arithmetic
inferred← citeshttps://doi.org/10.1007/978-1-4613-0609-2_13openalex-snapshot
Interpretability Logic
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90015-aopenalex-snapshot
Rudimentary reductions revisited
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90180-4openalex-snapshot
The graph of multiplication is equivalent to counting
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90066-2openalex-snapshot
On the scheme of induction for bounded arithmetic formulas
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00018-6openalex-snapshot
Pell equations and exponentiation in fragments of arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2007.05.004openalex-snapshot
Quadratic forms in models of IΔ0+Ω1 . I
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70471-3openalex-snapshot
Bounded Arithmetic Formulas and Turing Machines of Constant Alternation
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00030-xopenalex-snapshot
Bounded arithmetic, proof complexity and two papers of Parikh
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00110-9openalex-snapshot
On end extensions of models of subsystems of peano arithmetic
inferred← citeshttps://doi.org/10.1017/jsl.2024.44openalex-snapshot
A PARAMETERIZED HALTING PROBLEM, $ \Delta _0$ TRUTH AND THE MRDP THEOREM
inferred← citeshttps://doi.org/10.1109/sct.1990.113967openalex-snapshot
Bounded arithmetic and computational complexity
inferred← citeshttps://doi.org/10.1145/3209108.3209155openalex-snapshot
A parameterized halting problem, the linear time hierarchy, and the MRDP theorem
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.