On the public citation graph
Improved witnessing and local improvement principles for second-order bounded arithmetic
0 signed · 63 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/11780342_29openalex-snapshot
Forcing with Random Variables and Proof Complexity
inferredcites →https://doi.org/10.1007/s00153-011-0240-0openalex-snapshot
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
inferredcites →https://doi.org/10.1016/0304-3975(94)00107-3openalex-snapshot
First-order linear logic without modalities is NEXPTIME-hard
inferredcites →https://doi.org/10.1016/j.apal.2010.12.002openalex-snapshot
The provably total NP search problems of weak second order bounded arithmetic
inferredcites →https://doi.org/10.1016/j.apal.2011.06.014openalex-snapshot
Alternating minima and maxima, Nash equilibria and Bounded Arithmetic
inferredcites →https://doi.org/10.1016/j.tcs.2006.03.014openalex-snapshot
From truth to computability I
inferredcites →https://doi.org/10.1016/j.tcs.2007.01.004openalex-snapshot
From truth to computability II
inferredcites →https://doi.org/10.1016/j.tcs.2011.05.053openalex-snapshot
Corrected upper bounds for free-cut elimination
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1017/cbo9780511529948openalex-snapshot
Bounded Arithmetic, Propositional Logic and Complexity Theory
inferredcites →https://doi.org/10.1017/cbo9781139107211openalex-snapshot
Forcing with Random Variables and Proof Complexity
inferredcites →https://doi.org/10.1093/logcom/exl005openalex-snapshot
Introduction to Cirquent Calculus and Abstract Resource Semantics
inferredcites →https://doi.org/10.1112/plms/pdq044openalex-snapshot
The provably total search problems of bounded arithmetic
inferredcites →https://doi.org/10.1112/plms/s3-69.1.1openalex-snapshot
An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic
inferredcites →https://doi.org/10.1142/s0219061309000847openalex-snapshot
POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC
inferredcites →https://doi.org/10.1145/1131313.1131318openalex-snapshot
Propositional computability logic I
inferredcites →https://doi.org/10.1145/1131313.1131319openalex-snapshot
Propositional computability logic II
inferredcites →https://doi.org/10.1515/9783110324907.65openalex-snapshot
Characterising Definable Search Problems in Bounded Arithmetic via Proof Notations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6_24openalex-snapshot
Mining the Surface: Witnessing the Low Complexity Theorems of Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-20297-6_1openalex-snapshot
Propositional Proofs in Frege and Extended Frege Systems (Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_4openalex-snapshot
Short Proofs of the Kneser-Lovász Coloring Principle
inferred← citeshttps://doi.org/10.1007/978-3-662-55386-2_3openalex-snapshot
Total Search Problems in Bounded Arithmetic and Improved Witnessing
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.12.003openalex-snapshot
Towards a unified complexity theory of total functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.005openalex-snapshot
Quasipolynomial size proofs of the propositional pigeonhole principle
inferred← citeshttps://doi.org/10.1017/9781108242066.006openalex-snapshot
Quantified Propositional Calculus
inferred← citeshttps://doi.org/10.1017/9781108242066.008openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.010openalex-snapshot
Basic Example of the Correspondence between Theories and Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.011openalex-snapshot
The Two Worlds of Bounded Arithmetic
inferred← citeshttps://doi.org/10.1017/9781108242066.012openalex-snapshot
Up to EF via the 〈. . .〉 Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.013openalex-snapshot
Examples of Upper Bounds and p-Simulations
inferred← citeshttps://doi.org/10.1017/9781108242066.014openalex-snapshot
Beyond EF via the || . . . || Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.016openalex-snapshot
LKd+1/2 and Combinatorial Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.017openalex-snapshot
Fd and Logical Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.018openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.019openalex-snapshot
Feasible Interpolation: A Framework
inferred← citeshttps://doi.org/10.1017/9781108242066.020openalex-snapshot
Feasible Interpolation: Applications
inferred← citeshttps://doi.org/10.1017/9781108242066.022openalex-snapshot
Model Theory and Lower Bounds
inferred← citeshttps://doi.org/10.1017/9781108242066.024openalex-snapshot
The Nature of Proof Complexity
inferred← citeshttps://doi.org/10.1017/bsl.2017.32openalex-snapshot
INCOMPLETENESS IN THE FINITE DOMAIN
inferred← citeshttps://doi.org/10.1017/jsl.2015.17openalex-snapshot
QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS
inferred← citeshttps://doi.org/10.1017/s0960129524000185openalex-snapshot
Witnessing flows in arithmetic
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.00033openalex-snapshot
On Pigeonhole Principles and Ramsey in TFNP
inferred← citeshttps://doi.org/10.1142/s021906132250012xopenalex-snapshot
Approximate counting and NP search problems
inferred← citeshttps://doi.org/10.1145/3060145openalex-snapshot
The NP Search Problems of Frege and Extended Frege Proofs
inferred← citeshttps://doi.org/10.1145/3564246.3585253openalex-snapshot
On the Consistency of Circuit Lower Bounds for Non-deterministic Time
inferred← citeshttps://doi.org/10.4171/pm/1936openalex-snapshot
Bounded theories for polyspace computability
inferred← citeshttps://doi.org/10.4204/eptcs.191.5openalex-snapshot
Formalizing Termination Proofs under Polynomial Quasi-interpretations
inferred← citeshttps://doi.org/10.4230/lipics.csl.2020.12openalex-snapshot
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
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.